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 *

83 related articles for article (PubMed ID: 23003195)

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

  • 2. Ultrametricity of optimal transport substates for multiple interacting paths over a square lattice network.
    Cogoni M; Busonera G; Zanetti G
    Phys Rev E; 2017 Mar; 95(3-1):030108. PubMed ID: 28415372
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Routing in triple loop circulants: A case of networks-on-chip.
    Romanov AY; Starykh VA
    Heliyon; 2020 Jul; 6(7):e04427. PubMed ID: 32715123
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Effect of congestion costs on shortest paths through complex networks.
    Ashton DJ; Jarrett TC; Johnson NF
    Phys Rev Lett; 2005 Feb; 94(5):058701. PubMed ID: 15783707
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Randomized shortest-path problems: two related models.
    Saerens M; Achbany Y; Fouss F; Yen L
    Neural Comput; 2009 Aug; 21(8):2363-404. PubMed ID: 19323635
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 10. A minimum resource neural network framework for solving multiconstraint shortest path problems.
    Zhang J; Zhao X; He X
    IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1566-82. PubMed ID: 25050952
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

  • 17. Onset of traffic congestion in complex networks.
    Zhao L; Lai YC; Park K; Ye N
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Feb; 71(2 Pt 2):026125. PubMed ID: 15783396
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Inference and optimization of real edges on sparse graphs: a statistical physics perspective.
    Wong KY; Saad D
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Jul; 76(1 Pt 1):011115. PubMed ID: 17677418
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Congestion-gradient driven transport on complex networks.
    Danila B; Yu Y; Earl S; Marsh JA; Toroczkai Z; Bassler KE
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Oct; 74(4 Pt 2):046114. PubMed ID: 17155140
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.