par Kaminski, Marcin 
;Medvedev, Paul;Milanic, Martin
Référence Theoretical computer science, 412, 39, page (5205-5210)
Publication Publié, 2011
;Medvedev, Paul;Milanic, MartinRéférence Theoretical computer science, 412, 39, page (5205-5210)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | We study the following problem on reconfiguring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest st path and must differ from the previous one by only one vertex. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. © 2011 Elsevier B.V. All rights reserved. |
