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.
111 related articles for article (PubMed ID: 20628597)
1. Network conduciveness with application to the graph-coloring and independent-set optimization transitions. Barbosa VC PLoS One; 2010 Jul; 5(7):e11232. PubMed ID: 20628597 [TBL] [Abstract][Full Text] [Related]
2. The conduciveness of CA-rule graphs. Barbosa VC Artif Life; 2013; 19(2):255-66. PubMed ID: 23514240 [TBL] [Abstract][Full Text] [Related]
3. 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]
4. Statistical mechanics of maximal independent sets. Dall'Asta L; Pin P; Ramezanpour A Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 1):061136. PubMed ID: 20365147 [TBL] [Abstract][Full Text] [Related]
6. 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]
7. Exploring the evolution of London's street network in the information space: a dual approach. Masucci AP; Stanilov K; Batty M Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Jan; 89(1):012805. PubMed ID: 24580279 [TBL] [Abstract][Full Text] [Related]
14. Fitting a geometric graph to a protein-protein interaction network. Higham DJ; Rasajski M; Przulj N Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248 [TBL] [Abstract][Full Text] [Related]
15. Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm. Martín H JA PLoS One; 2013; 8(1):e53437. PubMed ID: 23349711 [TBL] [Abstract][Full Text] [Related]
16. Benchmarking treewidth as a practical component of tensor network simulations. Dumitrescu EF; Fisher AL; Goodrich TD; Humble TS; Sullivan BD; Wright AL PLoS One; 2018; 13(12):e0207827. PubMed ID: 30562341 [TBL] [Abstract][Full Text] [Related]
17. Graph-based semisupervised learning. Culp M; Michailidis G IEEE Trans Pattern Anal Mach Intell; 2008 Jan; 30(1):174-9. PubMed ID: 18000333 [TBL] [Abstract][Full Text] [Related]
18. Brain Storm Optimization Graph Theory (BSOGT) and Energy Resource Aware Virtual Network Mapping (ERVNM) for Medical Image System in Cloud. Palanikkumar D; Priya S J Med Syst; 2019 Jan; 43(2):37. PubMed ID: 30623258 [TBL] [Abstract][Full Text] [Related]
19. Vertex coloring of graphs via phase dynamics of coupled oscillatory networks. Parihar A; Shukla N; Jerry M; Datta S; Raychowdhury A Sci Rep; 2017 Apr; 7(1):911. PubMed ID: 28424457 [TBL] [Abstract][Full Text] [Related]
20. Frequency response and gap tuning for nonlinear electrical oscillator networks. Bhat HS; Vaz GJ PLoS One; 2013; 8(11):e78009. PubMed ID: 24223751 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]