Reconfiguration of vertex-disjoint shortest paths on graphs

DOI10.1007/978-3-031-27051-2_17OpenAlexW4324010208MaRDI QIDQ6091163

Rin Saito, Takehiro Ito, Ryuhei Uehara, Hiroshi Eto

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-27051-2_17

zbMATH Keywords

graph algorithmvertex-disjoint pathscombinatorial reconfiguration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• The complexity of rerouting shortest paths
• On the complexity of reconfiguration problems
• Shortest paths between shortest paths
• Reconfiguration in bounded bandwidth and tree-depth
• Introduction to reconfiguration
• Rerouting shortest paths in planar graphs
• The complexity of change

This page was built for publication: Reconfiguration of vertex-disjoint shortest paths on graphs