Faster 2-Disjoint-Shortest-Paths Algorithm

DOI10.1007/978-3-030-50026-9_7OpenAlexW3036445721MaRDI QIDQ5042231

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 theoryshortest pathslinear algebra

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest \((A+B)\)-path packing via hafnian
• The directed subgraph homeomorphism problem
• The disjoint shortest paths problem
• Disjoint Paths—A Survey
• Shortest Two Disjoint Paths in Polynomial Time
• Multiplying matrices faster than coppersmith-winograd
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen