Shortest Two Disjoint Paths in Polynomial Time

DOI10.1007/978-3-662-43948-7_18zbMath1398.68653OpenAlexW65356316MaRDI QIDQ5167743

Andreas Björklund, Thore Husfeldt

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_18

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Randomized algorithms (68W20)

Related Items (16)

Faster 2-Disjoint-Shortest-Paths Algorithm ⋮ Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs ⋮ On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems ⋮ Unnamed Item ⋮ On the edge capacitated Steiner tree problem ⋮ Finding a shortest non-zero path in group-labeled graphs via permanent computation ⋮ Algebraic methods in the congested clique ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Shortest \((A+B)\)-path packing via hafnian ⋮ The undirected two disjoint shortest paths problem ⋮ Walking through waypoints ⋮ The directed 2-linkage problem with length constraints ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ The Directed Disjoint Shortest Paths Problem ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

This page was built for publication: Shortest Two Disjoint Paths in Polynomial Time