par Kaminski, Marcin ;Medvedev, Paul;Milanic, Martin
Référence Lecture notes in computer science
Publication A Paraître, 2010
Article révisé par les pairs
Résumé : 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). © 2011 Springer-Verlag.