Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Fast exact algorithms via the Matrix Tree Theorem
V. Arvind, Srijan Chakraborty, Samir Datta +1
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each othe…
cs.DS2025
A parallel algorithm for the odd two-face shortest k-disjoint path problem
Srijan Chakraborty, Samir Datta
The shortest Disjoint Path problem (SDPP) requires us to find pairwise vertex disjoint paths between k designated pairs of terminal vertices such that the sum of the path lengths i…