|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
The number of guards needed by a museum: A phase transition in vertex covering of random graphs | | Martin Weigt
; Alexander K. Hartmann
; | | Date: |
11 Dec 1999 | | Journal: | Phys. Rev. Lett. 84, 6118 (2000) | | Subject: | Disordered Systems and Neural Networks; Statistical Mechanics; Computational Complexity | cond-mat.dis-nn cond-mat.stat-mech cs.CC | | Abstract: | 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 solvability and typical-case complexity occurs. This transition is characterized by means of exact numerical simulations as well as by analytical replica calculations. The replica symmetric phase diagram is in excellent agreement with numerical findings up to average connectivity $e$, where replica symmetry becomes locally unstable. | | Source: | arXiv, cond-mat/0001137 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER