Finding Paths between Graph Colourings: Computational Complexity and Possible Distances.
Paul S. BonsmaLuis CerecedaJan van den HeuvelMatthew JohnsonPublished in: Electron. Notes Discret. Math. (2007)
Keyphrases
- computational complexity
- path length
- graph structure
- graph theoretic
- np complete
- shortest path
- directed graph
- graph representation
- computational efficiency
- np hard
- structured data
- low complexity
- bipartite graph
- distance function
- weighted graph
- graph partitioning
- random walk
- computational cost
- strongly connected
- disjoint paths
- rate distortion
- data sets
- spanning tree