Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances

Paul S. Bonsma, Luis Cereceda. Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. In Ludek Kucera, Antonín Kucera, editors, Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings. Volume 4708 of Lecture Notes in Computer Science, pages 738-749, Springer, 2007. [doi]

Abstract

Abstract is missing.