Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances.

Paul S. Bonsma Luis Cereceda

Published in: Theor. Comput. Sci. (2009)

Keyphrases

graph representation
weighted graph
path length
graph structure
graph theory
shortest path
structured data
connected components
random walk
directed acyclic graph
directed graph
distance measure
bipartite graph
graph matching
temporal logic
graph databases
spanning tree
graph clustering
disjoint paths