The Complexity of Rerouting Shortest Paths

DOI10.1007/978-3-642-32589-2_22zbMath1365.68273OpenAlexW2569495562MaRDI QIDQ2912722

Paul Bonsma

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/the-complexity-of-rerouting-shortest-paths(c2a8e811-fbf8-4a98-8eaa-3826a04c18b4).html

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Finding shortest paths between graph colourings ⋮ Reconfiguration of dominating sets ⋮ Vertex Cover Reconfiguration and Beyond ⋮ Finding Shortest Paths Between Graph Colourings ⋮ Approximability of the subset sum reconfiguration problem ⋮ On the parameterized complexity of reconfiguration problems ⋮ Introduction to reconfiguration

This page was built for publication: The Complexity of Rerouting Shortest Paths