Shortest paths between shortest paths

Marcin Kamiski, Paul Medvedev, Martin Milani

Research output: Contribution to journalArticle

40 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)5205-5210
Number of pages6
JournalTheoretical Computer Science
Volume412
Issue number39
DOIs
StatePublished - Sep 9 2011

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Shortest paths between shortest paths'. Together they form a unique fingerprint.

  • Cite this

    Kamiski, M., Medvedev, P., & Milani, M. (2011). Shortest paths between shortest paths. Theoretical Computer Science, 412(39), 5205-5210. https://doi.org/10.1016/j.tcs.2011.05.021