Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.
Dorit DorMichael TarsiPublished in: SIAM J. Comput. (1997)
Keyphrases
- np complete
- polynomial time complexity
- pspace complete
- bounded treewidth
- np hard
- randomly generated
- graph representation
- conjunctive queries
- graph theory
- directed graph
- graph structure
- satisfiability problem
- constraint satisfaction problems
- graph partitioning
- bipartite graph
- weighted graph
- phase transition
- link analysis
- graph model
- random walk
- description logics
- linear logic
- query processing