The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.
Paul S. BonsmaAmer E. MouawadNaomi NishimuraVenkatesh RamanPublished in: IPEC (2014)
Keyphrases
- bounded treewidth
- constraint satisfaction problems
- bipartite graph
- graph representation
- computational complexity
- graph theory
- fixed length
- space complexity
- directed acyclic graph
- tree decomposition
- constraint satisfaction
- structured data
- np complete
- worst case
- causal graph
- polynomial time complexity
- tree decompositions
- weighted graph
- manufacturing systems
- random walk
- natural images
- np hard