The Complexity of Proving That a Graph Is Ramsey.
Massimo LauriaPavel PudlákVojtech RödlNeil ThapenPublished in: ICALP (1) (2013)
Keyphrases
- graph representation
- complexity analysis
- computational complexity
- graph structure
- database
- decision problems
- graph theory
- graph theoretic
- graph matching
- weighted graph
- bounded treewidth
- graph clustering
- graph partitioning
- graph databases
- link analysis
- semi supervised
- lower bound
- similarity measure
- image segmentation
- information systems
- social networks