Cargando…
Network Conduciveness with Application to the Graph-Coloring and Independent-Set Optimization Transitions
BACKGROUND: Given an undirected graph, we consider the two problems of combinatorial optimization, which ask that its chromatic and independence numbers be found. Although both problems are NP-hard, when either one is solved on the incrementally denser graphs of a random sequence, at certain critica...
| Autor principal: | |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2010
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2900201/ https://www.ncbi.nlm.nih.gov/pubmed/20628597 http://dx.doi.org/10.1371/journal.pone.0011232 |