Efficient algorithms for listing k disjoint st-paths in graphs

DOI10.1007/978-3-319-77404-6_40MaRDI QIDQ2294713zbMATH OpenOpenAlexFDO

Authors Roberto Grossi, Andrea Marino, Luca Versari

Publication date 12 February 2020

Full work available at URL https://doi.org/10.1007/978-3-319-77404-6_40

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Efficient Algorithms for k-Disjoint Paths Problems on DAGs
• Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs
• The Vertex-Disjoint Menger Problem in Planar Graphs
• On the disjoint paths problem
• Solving the 2-disjoint paths problem in nearly linear time

Cited in

(7)

• On b-acyclic chromatic number of a graph
• Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
• scientific article; zbMATH DE number 4205963 (Why is no real title available?)
• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• Optimal listing of cycles and st-paths in undirected graphs
• Disjoint multipath closeness centrality
• Enumerating \(m\)-length walks in directed graphs with constant delay

This page was built for publication: Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294713)