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.
115 related articles for article (PubMed ID: 27535466)
1. Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition. Hébert-Dufresne L; Grochow JA; Allard A Sci Rep; 2016 Aug; 6():31708. PubMed ID: 27535466 [TBL] [Abstract][Full Text] [Related]
2. Temporal node centrality in complex networks. Kim H; Anderson R Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Feb; 85(2 Pt 2):026107. PubMed ID: 22463279 [TBL] [Abstract][Full Text] [Related]
3. Ranking of critical species to preserve the functionality of mutualistic networks using the García-Algarra J; Pastor JM; Iriondo JM; Galeano J PeerJ; 2017; 5():e3321. PubMed ID: 28533969 [TBL] [Abstract][Full Text] [Related]
4. Onion structure and network robustness. Wu ZX; Holme P Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Aug; 84(2 Pt 2):026106. PubMed ID: 21929063 [TBL] [Abstract][Full Text] [Related]
5. Degree difference: a simple measure to characterize structural heterogeneity in complex networks. Farzam A; Samal A; Jost J Sci Rep; 2020 Dec; 10(1):21348. PubMed ID: 33288824 [TBL] [Abstract][Full Text] [Related]
14. Maximal prime subgraph decomposition of Bayesian networks. Olesen KG; Madsen AL IEEE Trans Syst Man Cybern B Cybern; 2002; 32(1):21-31. PubMed ID: 18238100 [TBL] [Abstract][Full Text] [Related]
15. Exploring complex networks via topological embedding on surfaces. Aste T; Gramatica R; Di Matteo T Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Sep; 86(3 Pt 2):036109. PubMed ID: 23030982 [TBL] [Abstract][Full Text] [Related]
16. Exploiting graphlet decomposition to explain the structure of complex networks: the GHuST framework. Espejo R; Mestre G; Postigo F; Lumbreras S; Ramos A; Huang T; Bompard E Sci Rep; 2020 Jul; 10(1):12884. PubMed ID: 32732972 [TBL] [Abstract][Full Text] [Related]
17. s-core network decomposition: a generalization of k-core analysis to weighted networks. Eidsaa M; Almaas E Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Dec; 88(6):062819. PubMed ID: 24483523 [TBL] [Abstract][Full Text] [Related]
18. Growing optimal scale-free networks via likelihood. Small M; Li Y; Stemler T; Judd K Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Apr; 91(4):042801. PubMed ID: 25974541 [TBL] [Abstract][Full Text] [Related]