Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses.
Adam R. KlivansDieter van MelkebeekPublished in: STOC (1999)
Keyphrases
- bounded treewidth
- bounded degree
- computational complexity
- special case
- polynomial size
- structured data
- np complete
- graph theory
- polynomial time complexity
- random walk
- graph isomorphism
- graph representation
- hierarchical structure
- tree shaped
- attack graph
- planar graphs
- maximal cliques
- causal graph
- graph theoretic
- graph model
- weighted graph
- graph structure
- bipartite graph
- graph matching
- directed graph
- connected components
- graph data
- graph construction
- graph partitioning
- higher level
- worst case