The Complexity of Bounded Length Graph Recoloring.
Paul S. BonsmaAmer E. MouawadPublished in: CoRR (2014)
Keyphrases
- bounded treewidth
- random walk
- computational complexity
- database
- path length
- graph representation
- graph model
- neural network
- structured data
- stable set
- space complexity
- graph theory
- graph matching
- connected components
- directed acyclic graph
- memory requirements
- complexity analysis
- graph theoretic
- np complete
- lower bound