Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- np hard
- planar graphs
- constraint satisfaction problems
- computational complexity
- randomly generated
- graph theoretic
- pspace complete
- graph matching
- satisfiability problem
- graph theory
- conjunctive queries
- phase transition
- random graphs
- data complexity
- graph partitioning
- bipartite graph
- directed graph
- line drawings
- weighted graph
- np complete problems
- planar surfaces
- single point
- graph clustering
- graph structure
- conp complete