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 *

118 related articles for article (PubMed ID: 34780522)

  • 1. On the asymptotic behavior of the average geodesic distance L and the compactness CB of simple connected undirected graphs whose order approaches infinity.
    Lokot T; Abramov O; Mehler A
    PLoS One; 2021; 16(11):e0259776. PubMed ID: 34780522
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the limit value of compactness of some graph classes.
    Lokot T; Mehler A; Abramov O
    PLoS One; 2018; 13(11):e0207536. PubMed ID: 30458027
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Local Multiset Dimension of Amalgamation Graphs.
    Alfarisi R; Susilowati L; Dafik D; Prabhu S
    F1000Res; 2023; 12():95. PubMed ID: 38835804
    [No Abstract]   [Full Text] [Related]  

  • 4. Dynamics of neural networks over undirected graphs.
    Goles E; Ruz GA
    Neural Netw; 2015 Mar; 63():156-69. PubMed ID: 25544654
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Building k-connected neighborhood graphs for isometric data embedding.
    Yang L
    IEEE Trans Pattern Anal Mach Intell; 2006 May; 28(5):827-31. PubMed ID: 16640268
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A simple interpretation of undirected edges in essential graphs is wrong.
    Kummerfeld E
    PLoS One; 2021; 16(4):e0249415. PubMed ID: 33831048
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Network synchronizability analysis: a graph-theoretic approach.
    Chen G; Duan Z
    Chaos; 2008 Sep; 18(3):037102. PubMed ID: 19045476
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Random graphs with arbitrary degree distributions and their applications.
    Newman ME; Strogatz SH; Watts DJ
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):026118. PubMed ID: 11497662
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the Solvability of the Discrete
    Pietrusiak F; Wieteska R; Gordinowicz P
    Entropy (Basel); 2022 Sep; 24(10):. PubMed ID: 37420372
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the nullity of a graph with cut-points.
    Gong SC; Xu GH
    Linear Algebra Appl; 2012 Jan; 436(1):135-142. PubMed ID: 22215910
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Approximate von Neumann entropy for directed graphs.
    Ye C; Wilson RC; Comin CH; Costa Lda F; Hancock ER
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 May; 89(5):052804. PubMed ID: 25353841
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Assessing statistical significance in causal graphs.
    Chindelevitch L; Loh PR; Enayetallah A; Berger B; Ziemek D
    BMC Bioinformatics; 2012 Feb; 13():35. PubMed ID: 22348444
    [TBL] [Abstract][Full Text] [Related]  

  • 14. The average distances in random graphs with given expected degrees.
    Chung F; Lu L
    Proc Natl Acad Sci U S A; 2002 Dec; 99(25):15879-82. PubMed ID: 12466502
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Infinite geodesic paths and fibers, new topological invariants in periodic graphs.
    Eon JG
    Acta Crystallogr A; 2007 Jan; 63(Pt 1):53-65. PubMed ID: 17179607
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Nonbacktracking expansion of finite graphs.
    Timár G; da Costa RA; Dorogovtsev SN; Mendes JFF
    Phys Rev E; 2017 Apr; 95(4-1):042322. PubMed ID: 28505741
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

  • 18. On the Adjacent Eccentric Distance Sum Index of Graphs.
    Qu H; Cao S
    PLoS One; 2015; 10(6):e0129497. PubMed ID: 26091095
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Faster algorithms for counting subgraphs in sparse graphs.
    Bressan M
    Algorithmica; 2021; 83(8):2578-2605. PubMed ID: 34720296
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Optimal Quantum Spatial Search on Random Temporal Networks.
    Chakraborty S; Novo L; Di Giorgio S; Omar Y
    Phys Rev Lett; 2017 Dec; 119(22):220503. PubMed ID: 29286791
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.