Shortest paths between shortest paths and independent sets

Marcin Kamiński, Paul Medvedev, Martin Milanič

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

We study problems of reconfiguration of shortest paths in graphs. 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. Moreover, we also study reconfiguration of independent sets in three different models and analyze relationships between these models, observing that shortest path reconfiguration is a special case of independent set reconfiguration in perfect graphs, under any of the three models. Finally, we give polynomial results for restricted classes of graphs (even-hole-free and P4-free graphs).

Original languageEnglish (US)
Title of host publicationCombinatorial Algorithms - 21st International Workshop, IWOCA 2010, Revised Selected Papers
Pages56-67
Number of pages12
DOIs
StatePublished - 2011
Event21st International Workshop on Combinatorial Algorithms, IWOCA 2010 - London, United Kingdom
Duration: Jul 26 2010Jul 28 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6460 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st International Workshop on Combinatorial Algorithms, IWOCA 2010
CountryUnited Kingdom
CityLondon
Period7/26/107/28/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this