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 *

94 related articles for article (PubMed ID: 17155132)

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

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

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

  • 7. Collectively optimal routing for congested traffic limited by link capacity.
    Danila B; Sun Y; Bassler KE
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066116. PubMed ID: 20365240
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Efficient rewirings for enhancing synchronizability of dynamical networks.
    Rad AA; Jalili M; Hasler M
    Chaos; 2008 Sep; 18(3):037104. PubMed ID: 19045478
    [TBL] [Abstract][Full Text] [Related]  

  • 9. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.
    He Y; Liu Z; Shi J; Wang Y; Zhang J; Liu J
    PLoS One; 2015; 10(7):e0131962. PubMed ID: 26226109
    [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. 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. 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]  

  • 13. Optimal structure of complex networks for minimizing traffic congestion.
    Zhao L; Cupertino TH; Park K; Lai YC; Jin X
    Chaos; 2007 Dec; 17(4):043103. PubMed ID: 18163767
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Traffic optimization in railroad networks using an algorithm mimicking an amoeba-like organism, Physarum plasmodium.
    Watanabe S; Tero A; Takamatsu A; Nakagaki T
    Biosystems; 2011 Sep; 105(3):225-32. PubMed ID: 21620930
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Betweenness centrality in a weighted network.
    Wang H; Hernandez JM; Van Mieghem P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Apr; 77(4 Pt 2):046105. PubMed ID: 18517688
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Geographical networks stochastically constructed by a self-similar tiling according to population.
    Hayashi Y; Ono Y
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Jul; 82(1 Pt 2):016108. PubMed ID: 20866690
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. ParRouting: An Efficient Area Partition-Based Congestion-Aware Routing Algorithm for NoCs.
    Fang J; Zhang D; Li X
    Micromachines (Basel); 2020 Nov; 11(12):. PubMed ID: 33255727
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.