These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

113 related articles for article (PubMed ID: 36266853)

  • 1. Cutting-plane algorithms and solution whitening for the vertex-cover problem.
    Claussen G; Hartmann AK
    Phys Rev E; 2022 Sep; 106(3-2):035305. PubMed ID: 36266853
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Phase transition for cutting-plane approach to vertex-cover problem.
    Dewenter T; Hartmann AK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Oct; 86(4 Pt 1):041128. PubMed ID: 23214550
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Clustering analysis of the ground-state structure of the vertex-cover problem.
    Barthel W; Hartmann AK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Dec; 70(6 Pt 2):066120. PubMed ID: 15697447
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.
    Takabe S; Hukushima K
    Phys Rev E; 2016 May; 93(5):053308. PubMed ID: 27301006
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Stability analysis on the finite-temperature replica-symmetric and first-step replica-symmetry-broken cavity solutions of the random vertex cover problem.
    Zhang P; Zeng Y; Zhou H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Aug; 80(2 Pt 1):021122. PubMed ID: 19792092
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Effect of constraint relaxation on the minimum vertex cover problem in random graphs.
    Dote A; Hukushima K
    Phys Rev E; 2024 Apr; 109(4-1):044304. PubMed ID: 38755898
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Number of guards needed by a museum: a phase transition in vertex covering of random graphs.
    Weigt M; Hartmann AK
    Phys Rev Lett; 2000 Jun; 84(26 Pt 1):6118-21. PubMed ID: 10991138
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm.
    Takabe S; Hukushima K
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Jun; 89(6):062139. PubMed ID: 25019756
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Detecting the solution space of vertex cover by mutual determinations and backbones.
    Wei W; Zhang R; Guo B; Zheng Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jul; 86(1 Pt 2):016112. PubMed ID: 23005496
    [TBL] [Abstract][Full Text] [Related]  

  • 10. TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs.
    Zhang Y; Wang S; Liu C; Zhu E
    Sensors (Basel); 2023 Sep; 23(18):. PubMed ID: 37765887
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs.
    Weigt M; Hartmann AK
    Phys Rev Lett; 2001 Feb; 86(8):1658-61. PubMed ID: 11290217
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Phase transitions in the coloring of random graphs.
    Zdeborová L; Krzakała F
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 1):031131. PubMed ID: 17930223
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming.
    Schawe H; Bleim R; Hartmann AK
    PLoS One; 2019; 14(4):e0215309. PubMed ID: 31002678
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Spin-glass phase transitions and minimum energy of the random feedback vertex set problem.
    Qin SM; Zeng Y; Zhou HJ
    Phys Rev E; 2016 Aug; 94(2-1):022146. PubMed ID: 27627285
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Minimal vertex covers on finite-connectivity random graphs: a hard-sphere lattice-gas picture.
    Weigt M; Hartmann AK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 May; 63(5 Pt 2):056127. PubMed ID: 11414981
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Linear Time Vertex Partitioning on Massive Graphs.
    Mell P; Harang R; Gueye A
    Int J Comput Sci (Rabat); 2016; 5(1):1-11. PubMed ID: 27336059
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Statistical mechanics of the minimum vertex cover problem in stochastic block models.
    Suzuki M; Kabashima Y
    Phys Rev E; 2019 Dec; 100(6-1):062101. PubMed ID: 31962393
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Dynamic thresholding search for the feedback vertex set problem.
    Sun W; Hao JK; Wu Z; Li W; Wu Q
    PeerJ Comput Sci; 2023; 9():e1245. PubMed ID: 37346631
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Ground-state entropy of the random vertex-cover problem.
    Zhou J; Zhou H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Feb; 79(2 Pt 1):020103. PubMed ID: 19391695
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Computational complexity arising from degree correlations in networks.
    Vázquez A; Weigt M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Feb; 67(2 Pt 2):027101. PubMed ID: 12636856
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.