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 *

132 related articles for article (PubMed ID: 20887063)

  • 21. A routing method with adaptively adjusting memory information based on local routing history.
    Kimura T; Shimada Y
    PLoS One; 2023; 18(4):e0283472. PubMed ID: 37075001
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 24. Effects of network structure and routing strategy on network capacity.
    Chen ZY; Wang XF
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Mar; 73(3 Pt 2):036107. PubMed ID: 16605598
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Abrupt transition to complete congestion on complex networks and control.
    Wang WX; Wu ZX; Jiang R; Chen G; Lai YC
    Chaos; 2009 Sep; 19(3):033106. PubMed ID: 19791986
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Routing Strategies for Isochronal-Evolution Random Matching Network.
    Lun W; Li Q; Zhu Z; Zhang C
    Entropy (Basel); 2023 Feb; 25(2):. PubMed ID: 36832731
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity.
    Zhou T; Liu JG; Bai WJ; Chen G; Wang BH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Nov; 74(5 Pt 2):056109. PubMed ID: 17279970
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency.
    Chujyo M; Hayashi Y
    PLoS One; 2022; 17(10):e0276733. PubMed ID: 36288333
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Traffic congestion and the lifetime of networks with moving nodes.
    Yang X; Li J; Pu C; Yan M; Sharafat RR; Yang J; Gakis K; Pardalos PM
    Phys Rev E; 2017 Jan; 95(1-1):012322. PubMed ID: 28208369
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A Novel Routing Scheme for Creating Opportunistic Context-Virtual Networks in IoT Scenarios.
    Galán-Jiménez J; Berrocal J; Garcia-Alonso J; Azabal MJ
    Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 31010182
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 34. An application of a computational ecology model to a routing method in computer networks.
    Yamasaki T; Ushio T
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(1):99-106. PubMed ID: 18238108
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Fast routing in road networks with transit nodes.
    Bast H; Funke S; Sanders P; Schultes D
    Science; 2007 Apr; 316(5824):566. PubMed ID: 17463281
    [TBL] [Abstract][Full Text] [Related]  

  • 36. A spectrum of routing strategies for brain networks.
    Avena-Koenigsberger A; Yan X; Kolchinsky A; van den Heuvel MP; Hagmann P; Sporns O
    PLoS Comput Biol; 2019 Mar; 15(3):e1006833. PubMed ID: 30849087
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Efficient target strategies for contagion in scale-free networks.
    Duan W; Chen Z; Liu Z; Jin W
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Aug; 72(2 Pt 2):026133. PubMed ID: 16196670
    [TBL] [Abstract][Full Text] [Related]  

  • 38. The first experimental demonstration of a DREAM-based large-scale optical transport network with 1000 control plane nodes.
    Zhang J; Zhao Y; Chen X; Ji Y; Zhang M; Wang H; Zhao Y; Tu Y; Wang Z; Li H
    Opt Express; 2011 Dec; 19(26):B746-55. PubMed ID: 22274097
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Previous]   [Next]    [New Search]
    of 7.