Given a connected graph G of m edges and n vertices, we consider the basic problem of listing all the choices of k vertex-disjoint st-paths, for any two input vertices s, t of G and a positive integer k. Our algorithm takes O(m) time per solution, using O(m) space and requiring O(Fk(G)) setup time, where (Formula presented) is the cost of running a max-flow algorithm on G to compute a flow of size k. The proposed techniques are simple and apply to other related listing problems discussed in the paper.
CITATION STYLE
Grossi, R., Marino, A., & Versari, L. (2018). Efficient algorithms for listing k disjoint st-paths in graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10807 LNCS, pp. 544–557). Springer Verlag. https://doi.org/10.1007/978-3-319-77404-6_40
Mendeley helps you to discover research relevant for your work.