Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses.
Adam R. KlivansDieter van MelkebeekPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- bounded treewidth
- bounded degree
- graph representation
- polynomial size
- computational complexity
- special case
- np complete
- graph isomorphism
- graph theory
- graph structure
- graph theoretic
- hierarchical structure
- maximal cliques
- maximum clique
- tree shaped
- polynomial time complexity
- random walk
- planar graphs
- higher level
- graph search
- spanning tree
- graph model
- graph mining
- directed graph