Faster 2-Disjoint-Shortest-Paths Algorithm

DOI10.1007/978-3-030-50026-9_7MaRDI QIDQ5042231zbMATH OpenOpenAlexFDO

Authors Maxim Akhmedov

Publication date 19 October 2022

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50026-9_7

zbMATH Keywords

dynamic programminggraph theorylinear algebrashortest paths

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm
• Disjoint Paths—A Survey
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• Multiplying matrices faster than coppersmith-winograd
• Shortest \((A+B)\)-path packing via hafnian
• Shortest k-disjoint paths via determinants
• Shortest two disjoint paths in polynomial time
• The directed subgraph homeomorphism problem
• The disjoint shortest paths problem

Cited in

(6)

• Faster algorithm to find anti-risk path between two nodes of an undirected graph
• Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
• Detecting disjoint shortest paths in linear time and more
• Lower bounds for approximate (\& exact) k-disjoint-shortest-paths
• Lower bounds for approximate (\& exact) \(k\)-\textsc{Disjoint-Shortest-Paths}
• Using a geometric Lens to find k disjoint shortest paths

This page was built for publication: Faster 2-Disjoint-Shortest-Paths Algorithm

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