Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random Graphs
about
Minimal vertex covers on finite-connectivity random graphs: A hard-sphere lattice-gas pictureConnecting core percolation and controllability of complex networksStatistical mechanics of maximal independent sets.Statistical mechanics of the quantum K -satisfiability problem.Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.Stability-to-instability transition in the structure of large-scale networks.Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm.Core percolation on complex networks.Phase transition for cutting-plane approach to vertex-cover problem.Detecting the solution space of vertex cover by mutual determinations and backbones.Optimal vertex cover for the small-world Hanoi networks.Numerical solution-space analysis of satisfiability problems.Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.Ground-state entropy of the random vertex-cover problem.Statistical mechanics of the hitting set problem.RNA secondary structure design.Message passing for vertex covers.Maximum independent set on diluted triangular lattices.Polynomial iterative algorithms for coloring and analyzing random graphs.Computational complexity arising from degree correlations in networks.Coloring random graphs.Exact solutions for diluted spin glasses and optimization problems.Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs.Evolution of networksDistance-dcovering problems in scale-free networks with degree correlationsSolving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithmsSimplest randomK-satisfiability problem
P2860
Q27345461-E0413277-3172-493F-9DA9-4A518A7D16A3Q40915968-486900E9-BD9E-4BD5-A503-D0BFA5D8C36CQ45339351-D17B3B33-4C0E-4500-8914-4E99132D7C5BQ46217180-6DE9C928-E451-4BFF-9D2D-8E9AC54B0BA2Q50627294-C9561E29-986E-4A8F-9A81-2E18828DA144Q50916383-0303E096-C455-4B25-BF97-F3A36F960A7DQ51067751-EDC0FFA0-9ECC-4FCD-B0B2-223F10D2D371Q51291382-BB9234B0-D6BA-4FCA-A1CD-5FE4154A6258Q51292350-DA4AA9CA-4B60-4513-BA34-6E84680BEB4CQ51319078-AA5B6B6D-0658-44BE-BE52-C03AA205BF69Q51537573-CE0269A2-6FC1-4EB8-BDE4-F63BFB3DB79CQ51614311-5C843993-8E28-4D73-9EBD-7F880EB40B48Q51640567-1675D991-A8A9-4939-9BF9-61E6E2B141C7Q51837483-990BD5B2-68B7-44AB-9328-2331F6C47248Q51901406-EE901BE6-8724-49EF-9C91-CDAC4D572C1EQ51920172-AE7E7388-8482-49FB-8E5B-F9853DD366ECQ51927237-1E02F1B3-B63C-4663-8A68-FADFDBF242FAQ51938950-A29B9BDD-2A99-4A85-9AB5-933567901A56Q52008408-EE4C9A17-A068-428A-9FD9-E0C5FA776F79Q52020457-9CFF3E2A-2D86-43A2-8124-E48011EE4DA7Q52026352-D66ABB10-5610-4FA6-AA98-D604994EEAA2Q52054116-D702A770-BADD-4430-8450-5C5726011122Q52066136-FE068472-4446-4E1E-B86B-7643023A2FFDQ56170571-0E93055A-88AC-4800-8556-AFF76E119C10Q57089028-7C393D88-2D4E-4E34-822B-620E62E86891Q58001590-B7C818FF-0AC7-4C60-99E8-1C45F1374FE9Q58001606-78E0885A-26D5-49AC-B111-304A0A65A624
P2860
Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random Graphs
description
article publié dans la revue scientifique Physical Review Letters
@fr
im Juni 2000 veröffentlichter wissenschaftlicher Artikel
@de
scientific article published in Physical Review Letters
@en
wetenschappelijk artikel
@nl
наукова стаття, опублікована в червні 2000
@uk
name
Number of Guards Needed by a M ...... rtex Covering of Random Graphs
@en
Number of Guards Needed by a M ...... rtex Covering of Random Graphs
@nl
type
label
Number of Guards Needed by a M ...... rtex Covering of Random Graphs
@en
Number of Guards Needed by a M ...... rtex Covering of Random Graphs
@nl
prefLabel
Number of Guards Needed by a M ...... rtex Covering of Random Graphs
@en
Number of Guards Needed by a M ...... rtex Covering of Random Graphs
@nl
P2860
P1476
Number of Guards Needed by a M ...... rtex Covering of Random Graphs
@en
P2093
Alexander K. Hartmann
P2860
P304
P356
10.1103/PHYSREVLETT.84.6118
P407
P50
P577
2000-06-26T00:00:00Z
P698
P818
cond-mat/0001137