On the tractability of coloring semirandom graphs.
Julia BöttcherDan VilenchikPublished in: Inf. Process. Lett. (2008)
Keyphrases
- np complete
- constraint satisfaction
- graph theory
- graph matching
- graph mining
- graph representation
- structured objects
- series parallel
- subgraph isomorphism
- graph structure
- small world
- directed graph
- graph theoretic
- graph model
- graph isomorphism
- real time
- graph databases
- bipartite graph
- knn
- computational complexity
- bayesian networks
- website
- data sets