Number of guards needed by a museum: A phase transition in vertex covering of random graphs

M Weigt, AK Hartmann - Physical review letters, 2000 - APS
In this Letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …
被引用次数：166 相关文章
[PDF] researchgate.net

[PDF][PDF] The number of guards needed by a museum: a phase transition in vertex covering of random graphs

M Weigt, AK Hartmann - arXiv preprint cond-mat/0001137 - researchgate.net
In this letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …

Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random Graphs

M Weigt, AK Hartmann - Physical Review Letters, 2000 - ui.adsabs.harvard.edu
In this Letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …

Number of guards needed by a museum: A phase transition in vertex covering of random graphs

M Weigt, AK Hartmann - 2000 - publications.goettingen-research …
In this Letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …

Number of guards needed by a museum: a phase transition in vertex covering of random graphs

M Weigt, AK Hartmann - Physical review letters, 2000 - pubmed.ncbi.nlm.nih.gov
In this Letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …

[引用][C] Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random Graphs

M Weigt, AK Hartmann - Physical Review Letters, 2000 - cir.nii.ac.jp
Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of
Random Graphs | CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ …

Number of guards needed by a museum: a phase transition in vertex covering of random graphs.

M Weigt, AK Hartmann - Physical Review Letters, 2000 - europepmc.org
In this Letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …

The number of guards needed by a museum: A phase transition in vertex covering of random graphs

M Weigt, AK Hartmann - arXiv preprint cond-mat/0001137, 2000 - arxiv.org
In this letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …
[PDF] academia.edu

[PDF][PDF] The number of guards needed by a museum: a phase transition in vertex covering of random graphs

M Weigt, AK Hartmann - arXiv preprint cond-mat/0001137 - academia.edu
In this letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …
[PDF] academia.edu

[PDF][PDF] The number of guards needed by a museum: a phase transition in vertex covering of random graphs

M Weigt, AK Hartmann - arXiv preprint cond-mat/0001137 - academia.edu
In this letter we study the NP-complete vertex cover problem on finite connectivity random
graphs. When the allowed size of the cover set is decreased, a discontinuous transition in …