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 *

106 related articles for article (PubMed ID: 21929073)

  • 1. Efficient routing strategies in scale-free networks with limited bandwidth.
    Tang M; Zhou T
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Aug; 84(2 Pt 2):026116. PubMed ID: 21929073
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network.
    Huang W; Chow TW
    Chaos; 2010 Sep; 20(3):033123. PubMed ID: 20887063
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Self avoiding paths routing algorithm in scale-free networks.
    Rachadi A; Jedra M; Zahid N
    Chaos; 2013 Mar; 23(1):013114. PubMed ID: 23556951
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Global dynamic routing for scale-free networks.
    Ling X; Hu MB; Jiang R; Wu QS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Jan; 81(1 Pt 2):016113. PubMed ID: 20365438
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Pheromone routing protocol on a scale-free network.
    Ling X; Hu MB; Jiang R; Wang R; Cao XB; Wu QS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066110. PubMed ID: 20365234
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Efficient routing on complex networks.
    Yan G; Zhou T; Hu B; Fu ZQ; Wang BH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Apr; 73(4 Pt 2):046108. PubMed ID: 16711879
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Traffic dynamics based on local routing protocol on a scale-free network.
    Wang WX; Wang BH; Yin CY; Xie YB; Zhou T
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Feb; 73(2 Pt 2):026111. PubMed ID: 16605402
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Efficient path routing strategy for flows with multiple priorities on scale-free networks.
    Zhang X; Zhou Z; Cheng D
    PLoS One; 2017; 12(2):e0172035. PubMed ID: 28199382
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Dynamic source routing strategy for two-level flows on scale-free networks.
    Jiang ZY; Liang MG; Wu JJ
    PLoS One; 2013; 8(12):e82162. PubMed ID: 24349207
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Neural networks for shortest path computation and routing in computer networks.
    Ali MM; Kamoun F
    IEEE Trans Neural Netw; 1993; 4(6):941-54. PubMed ID: 18276524
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Method to enhance traffic capacity for scale-free networks.
    Liu Z; Hu MB; Jiang R; Wang WX; Wu QS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 2):037101. PubMed ID: 17930368
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Advanced Algorithms for Local Routing Strategy on Complex Networks.
    Lin B; Chen B; Gao Y; Tse CK; Dong C; Miao L; Wang B
    PLoS One; 2016; 11(7):e0156756. PubMed ID: 27434502
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Efficient routing for spatial networks.
    Lin H; Xia Y; Liang Y
    Chaos; 2022 May; 32(5):053110. PubMed ID: 35649983
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Local versus global knowledge in the Barabási-Albert scale-free network model.
    Gómez-Gardeñes J; Moreno Y
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Mar; 69(3 Pt 2):037103. PubMed ID: 15089443
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Weighted scale-free networks in Euclidean space using local selection rule.
    Mukherjee G; Manna SS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Sep; 74(3 Pt 2):036111. PubMed ID: 17025712
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Integrating local static and dynamic information for routing traffic.
    Wang WX; Yin CY; Yan G; Wang BH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Jul; 74(1 Pt 2):016101. PubMed ID: 16907145
    [TBL] [Abstract][Full Text] [Related]  

  • 17. AIB-OR: improving onion routing circuit construction using anonymous identity-based cryptosystems.
    Wang C; Shi D; Xu X
    PLoS One; 2015; 10(3):e0121226. PubMed ID: 25815879
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Maximum Concurrent Flow Solutions for Improved Routing in IoT Future Networks.
    Djaker AB; Kechar B; Afifi H; Moungla H
    Arab J Sci Eng; 2022 Nov; ():1-20. PubMed ID: 36466583
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Path finding strategies in scale-free networks.
    Kim BJ; Yoon CN; Han SK; Jeong H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Feb; 65(2 Pt 2):027103. PubMed ID: 11863694
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Global benefit of randomness in individual routing on transportation networks.
    Tai TS; Yeung CH
    Phys Rev E; 2019 Jul; 100(1-1):012311. PubMed ID: 31499765
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.