A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs.
Andrej BogdanovKenji ObataLuca TrevisanPublished in: FOCS (2002)
Keyphrases
- lower bound
- bounded degree
- graph theoretic
- upper bound
- bounded treewidth
- branch and bound
- branch and bound algorithm
- objective function
- worst case
- graph theory
- optimal solution
- np hard
- graph matching
- social networks
- phase transition
- lower and upper bounds
- test cases
- graph mining
- np complete
- data sources
- database systems