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 *

111 related articles for article (PubMed ID: 31423073)

  • 1. Graph limits of random graphs from a subset of connected k-trees.
    Drmota M; Jin EY; Stufler B
    Random Struct Algorithms; 2019 Aug; 55(1):125-152. PubMed ID: 31423073
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Clique percolation in random graphs.
    Li M; Deng Y; Wang BH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Oct; 92(4):042116. PubMed ID: 26565177
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Clique percolation in random networks.
    Derényi I; Palla G; Vicsek T
    Phys Rev Lett; 2005 Apr; 94(16):160202. PubMed ID: 15904198
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Hard optimization problems have soft edges.
    Marino R; Kirkpatrick S
    Sci Rep; 2023 Mar; 13(1):3671. PubMed ID: 36871049
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Random geometric graphs in high dimension.
    Erba V; Ariosto S; Gherardi M; Rotondo P
    Phys Rev E; 2020 Jul; 102(1-1):012306. PubMed ID: 32794907
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Locally common graphs.
    Csóka E; Hubai T; Lovász L
    J Graph Theory; 2023 Mar; 102(3):472-483. PubMed ID: 37064728
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Escape regimes of biased random walks on Galton-Watson trees.
    Bowditch A
    Probab Theory Relat Fields; 2018; 170(3):685-768. PubMed ID: 31258234
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Inferring optimal species trees under gene duplication and loss.
    Bayzid MS; Mirarab S; Warnow T
    Pac Symp Biocomput; 2013; ():250-61. PubMed ID: 23424130
    [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. Nonuniform random graphs on the plane: A scaling study.
    Martínez-Martínez CT; Méndez-Bermúdez JA; Rodrigues FA; Estrada E
    Phys Rev E; 2022 Mar; 105(3-1):034304. PubMed ID: 35428102
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. On Extremal Graphs of Degree Distance Index by Using Edge-Grafting Transformations Method.
    Imran M; Akhtar S; Ahmad U; Ahmad S; Bilal A
    Comb Chem High Throughput Screen; 2022; 25(3):560-567. PubMed ID: 33357180
    [TBL] [Abstract][Full Text] [Related]  

  • 16. The Complexity of Two Colouring Games.
    Andres SD; Dross F; Huggan MA; Mc Inerney F; Nowakowski RJ
    Algorithmica; 2023; 85(4):1067-1090. PubMed ID: 37008075
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Are randomly grown graphs really random?
    Callaway DS; Hopcroft JE; Kleinberg JM; Newman ME; Strogatz SH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Oct; 64(4 Pt 1):041902. PubMed ID: 11690047
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO
    Day MC; Hawthorne FC
    Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Hosoya Polynomial for Subdivided Caterpillar Graphs.
    Numan M; Nawaz A; Aslam A; Butt SI
    Comb Chem High Throughput Screen; 2022; 25(3):554-559. PubMed ID: 33308123
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
    Azam NA; Shurbevski A; Nagamochi H
    Entropy (Basel); 2020 Aug; 22(9):. PubMed ID: 33286692
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.