Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2012.337
URN: urn:nbn:de:0030-drops-38715
URL: https://drops.dagstuhl.de/opus/volltexte/2012/3871/
Bonsma, Paul
Rerouting shortest paths in planar graphs
| pdf-format: |
|
Abstract
A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the Shortest Path Rerouting Problem, which asks, given two shortest st-paths P and Q in a graph G, whether a rerouting sequence exists from P to Q. This problem is PSPACE-hard in general, but we show that it can be solved in polynomial time if G is planar. To this end, we introduce a dynamic programming method for reconfiguration problems.
BibTeX - Entry
@InProceedings{bonsma:LIPIcs:2012:3871,
author = {Paul Bonsma},
title = {{Rerouting shortest paths in planar graphs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) },
pages = {337--349},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-47-7},
ISSN = {1868-8969},
year = {2012},
volume = {18},
editor = {Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2012/3871},
URN = {urn:nbn:de:0030-drops-38715},
doi = {10.4230/LIPIcs.FSTTCS.2012.337},
annote = {Keywords: shortest path, rerouting, reconfiguration problem, planar graph, polynomial time, dynamic programming}
}
| Keywords: | shortest path, rerouting, reconfiguration problem, planar graph, polynomial time, dynamic programming | |
| Seminar: | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) | |
| Issue date: | 2012 | |
| Date of publication: | 14.12.2012 |
