Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances.
Paul S. BonsmaLuis CerecedaPublished in: MFCS (2007)
Keyphrases
- distance measure
- graph representation
- path length
- structured data
- graph partitioning
- graph matching
- strongly connected
- dissimilarity measure
- graph structure
- bipartite graph
- connected components
- temporal logic
- data quality
- graph model
- graph databases
- distance function
- graph theoretic
- path finding
- shortest path
- decision procedures
- image segmentation