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 *

182 related articles for article (PubMed ID: 27791075)

  • 1. Network dismantling.
    Braunstein A; Dall'Asta L; Semerjian G; Zdeborová L
    Proc Natl Acad Sci U S A; 2016 Nov; 113(44):12368-12373. PubMed ID: 27791075
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Dismantling efficiency and network fractality.
    Im YS; Kahng B
    Phys Rev E; 2018 Jul; 98(1-1):012316. PubMed ID: 30110770
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Long-loop feedback vertex set and dismantling on bipartite factor graphs.
    Li T; Zhang P; Zhou HJ
    Phys Rev E; 2021 Jun; 103(6):L061302. PubMed ID: 34271758
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Lower bound of network dismantling problem.
    Sun J; Liu R; Fan Z; Xie J; Ma X; Hu Y
    Chaos; 2018 Jun; 28(6):063128. PubMed ID: 29960416
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Fast and simple decycling and dismantling of networks.
    Zdeborová L; Zhang P; Zhou HJ
    Sci Rep; 2016 Nov; 6():37954. PubMed ID: 27897223
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Generalized network dismantling.
    Ren XL; Gleinig N; Helbing D; Antulov-Fantulin N
    Proc Natl Acad Sci U S A; 2019 Apr; 116(14):6554-6559. PubMed ID: 30877241
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Effect of volume growth on the percolation threshold in random directed acyclic graphs with a given degree distribution.
    Schamboeck V; Kryven I; Iedema PD
    Phys Rev E; 2020 Jan; 101(1-1):012303. PubMed ID: 32069527
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Influence maximization in complex networks through optimal percolation.
    Morone F; Makse HA
    Nature; 2015 Aug; 524(7563):65-8. PubMed ID: 26131931
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Nonbacktracking expansion of finite graphs.
    Timár G; da Costa RA; Dorogovtsev SN; Mendes JFF
    Phys Rev E; 2017 Apr; 95(4-1):042322. PubMed ID: 28505741
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Random graph models for directed acyclic networks.
    Karrer B; Newman ME
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Oct; 80(4 Pt 2):046110. PubMed ID: 19905393
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Theory of percolation on hypergraphs.
    Bianconi G; Dorogovtsev SN
    Phys Rev E; 2024 Jan; 109(1-1):014306. PubMed ID: 38366459
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks.
    He H; Zhu Z; Mäkinen E
    IEEE Trans Neural Netw; 2009 Jun; 20(6):973-82. PubMed ID: 19398401
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Neural extraction of multiscale essential structure for network dismantling.
    Liu Q; Wang B
    Neural Netw; 2022 Oct; 154():99-108. PubMed ID: 35872517
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks.
    Almeira N; Billoni OV; Perotti JI
    Phys Rev E; 2020 Jan; 101(1-1):012306. PubMed ID: 32069537
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Message passing theory for percolation models on multiplex networks with link overlap.
    Cellai D; Dorogovtsev SN; Bianconi G
    Phys Rev E; 2016 Sep; 94(3-1):032301. PubMed ID: 27739774
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fragmentation properties of two-dimensional proximity graphs considering random failures and targeted attacks.
    Norrenbrock C; Melchert O; Hartmann AK
    Phys Rev E; 2016 Dec; 94(6-1):062125. PubMed ID: 28085361
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Are randomly grown graphs really random?
    Callaway DS; Hopcroft JE; Kleinberg JM; Newman ME; Strogatz SH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Oct; 64(4 Pt 1):041902. PubMed ID: 11690047
    [TBL] [Abstract][Full Text] [Related]  

  • 19. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Network robustness and fragility: percolation on random graphs.
    Callaway DS; Newman ME; Strogatz SH; Watts DJ
    Phys Rev Lett; 2000 Dec; 85(25):5468-71. PubMed ID: 11136023
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.