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 *

171 related articles for article (PubMed ID: 23005496)

  • 1. 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]  

  • 2. 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]  

  • 3. 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]  

  • 4. Towards a snowdrift game optimization to vertex cover of networks.
    Yang Y; Li X
    IEEE Trans Cybern; 2013 Jun; 43(3):948-56. PubMed ID: 23096076
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 6. 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]  

  • 7. 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]  

  • 8. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.
    Barbu A; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2005 Aug; 27(8):1239-53. PubMed ID: 16119263
    [TBL] [Abstract][Full Text] [Related]  

  • 9. 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]  

  • 10. Analyses of simple hybrid algorithms for the vertex cover problem.
    Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
    Evol Comput; 2009; 17(1):3-19. PubMed ID: 19207086
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
    Guo M; Chang WL; Ho M; Lu J; Cao J
    Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836
    [TBL] [Abstract][Full Text] [Related]  

  • 12. 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]  

  • 13. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Asymmetric Game: A Silver Bullet to Weighted Vertex Cover of Networks.
    Tang C; Li A; Li X
    IEEE Trans Cybern; 2018 Oct; 48(10):2994-3005. PubMed ID: 29035235
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Statistical mechanics of the hitting set problem.
    Mézard M; Tarzia M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct; 76(4 Pt 1):041124. PubMed ID: 17994953
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Structural information content of networks: graph entropy based on local vertex functionals.
    Dehmer M; Emmert-Streib F
    Comput Biol Chem; 2008 Apr; 32(2):131-8. PubMed ID: 18243802
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks.
    Yigit Y; Dagdeviren O; Challenger M
    Sensors (Basel); 2022 May; 22(10):. PubMed ID: 35632182
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Quantum algorithms and mathematical formulations of biomolecular solutions of the vertex cover problem in the finite-dimensional hilbert space.
    Chang WL; Ren TT; Feng M
    IEEE Trans Nanobioscience; 2015 Jan; 14(1):121-8. PubMed ID: 25494513
    [TBL] [Abstract][Full Text] [Related]  

  • 19. 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]  

  • 20. Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
    Pourhassan M; Shi F; Neumann F
    Evol Comput; 2019; 27(4):559-575. PubMed ID: 31012735
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.