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 *

98 related articles for article (PubMed ID: 21230151)

  • 1. Optimization of transport protocols with path-length constraints in complex networks.
    Ramasco JJ; de La Lama MS; López E; Boettcher S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Sep; 82(3 Pt 2):036119. PubMed ID: 21230151
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Transport optimization on complex networks.
    Danila B; Yu Y; Marsh JA; Bassler KE
    Chaos; 2007 Jun; 17(2):026102. PubMed ID: 17614689
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Optimal transport on complex networks.
    Danila B; Yu Y; Marsh JA; Bassler KE
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Oct; 74(4 Pt 2):046106. PubMed ID: 17155132
    [TBL] [Abstract][Full Text] [Related]  

  • 4. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. An Optimization Routing Algorithm Based on Segment Routing in Software-Defined Networks.
    Hou X; Wu M; Zhao M
    Sensors (Basel); 2018 Dec; 19(1):. PubMed ID: 30583564
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. An efficient and global interactive optimization methodology for path planning with multiple routing constraints.
    Xie G; Du X; Li S; Yang J; Hei X; Wen T
    ISA Trans; 2022 Feb; 121():206-216. PubMed ID: 33867133
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Inter-domain routing based on simulated annealing algorithm in optical mesh networks.
    Wang L; Zhang H; Zheng X
    Opt Express; 2004 Jul; 12(14):3095-107. PubMed ID: 19483829
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Efficient shortest-path-tree computation in network routing based on pulse-coupled neural networks.
    Qu H; Yi Z; Yang SX
    IEEE Trans Cybern; 2013 Jun; 43(3):995-1010. PubMed ID: 23144039
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Label-based routing for a family of small-world Farey graphs.
    Zhai Y; Wang Y
    Sci Rep; 2016 May; 6():25621. PubMed ID: 27167605
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Navigating ultrasmall worlds in ultrashort time.
    Boguñá M; Krioukov D
    Phys Rev Lett; 2009 Feb; 102(5):058701. PubMed ID: 19257567
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Competition for shortest paths on sparse graphs.
    Yeung CH; Saad D
    Phys Rev Lett; 2012 May; 108(20):208701. PubMed ID: 23003195
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.
    Rodríguez-Puente R; Lazo-Cortés MS
    Springerplus; 2013; 2():291. PubMed ID: 24010024
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Limited path percolation in complex networks.
    López E; Parshani R; Cohen R; Carmi S; Havlin S
    Phys Rev Lett; 2007 Nov; 99(18):188701. PubMed ID: 17995444
    [TBL] [Abstract][Full Text] [Related]  

  • 18. The Trade-Offs between Optimality and Feasibility in Online Routing with Dedicated Path Protection in Elastic Optical Networks.
    Olszewski I; Szcześniak I
    Entropy (Basel); 2022 Jun; 24(7):. PubMed ID: 35885114
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Direct determination of reaction paths and stationary points on potential of mean force surfaces.
    Li G; Cui Q
    J Mol Graph Model; 2005 Oct; 24(2):82-93. PubMed ID: 16005650
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Complex networks in confined comminution.
    Walker DM; Tordesillas A; Einav I; Small M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Aug; 84(2 Pt 1):021301. PubMed ID: 21928984
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.