Average-case complexity of backtrack search for coloring sparse random graphs.
Zoltán Ádám MannAniko SzajkoPublished in: J. Comput. Syst. Sci. (2013)
Keyphrases
- random graphs
- backtrack search
- average case complexity
- constraint satisfaction
- graph theoretic
- average case
- constraint satisfaction problems
- phase transition
- constraint programming
- highly efficient
- sat solvers
- branch and bound algorithm
- propositional satisfiability
- lower bound
- search algorithm
- small world
- undirected graph
- np complete
- low cost
- ranking algorithm
- search strategies
- graph theory
- complex networks
- upper bound