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 *

342 related articles for article (PubMed ID: 32025196)

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

  • 2. Connectivity of Triangulation Flip Graphs in the Plane.
    Wagner U; Welzl E
    Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. On the antimagicness of generalized edge corona graphs.
    D N; S DY
    Heliyon; 2024 Jan; 10(2):e24002. PubMed ID: 38293383
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A Simple Algorithm for Finding All k-Edge-Connected Components.
    Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH
    PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Parameterized Complexity of Eulerian Deletion Problems.
    Cygan M; Marx D; Pilipczuk M; Pilipczuk M; Schlotter I
    Algorithmica; 2014; 68(1):41-61. PubMed ID: 24415818
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Vertex-connectivity in periodic graphs and underlying nets of crystal structures.
    Eon JG
    Acta Crystallogr A Found Adv; 2016 May; 72(Pt 3):376-84. PubMed ID: 27126114
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 10. How to Direct the Edges of the Connectomes: Dynamics of the Consensus Connectomes and the Development of the Connections in the Human Brain.
    Kerepesi C; Szalkai B; Varga B; Grolmusz V
    PLoS One; 2016; 11(6):e0158680. PubMed ID: 27362431
    [TBL] [Abstract][Full Text] [Related]  

  • 11. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The Connected
    Bai C; Zhou J; Liang Z
    Comput Intell Neurosci; 2021; 2021():3533623. PubMed ID: 34992643
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints.
    Thejaswi S; Gionis A; Lauri J
    Big Data; 2020 Oct; 8(5):335-362. PubMed ID: 33017173
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Prime labeling of graphs constructed from wheel graph.
    Abughazaleh B; Abughneim OA
    Heliyon; 2024 Jan; 10(2):e23979. PubMed ID: 38293456
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 19. Local total anti-magic chromatic number of graphs.
    Sandhiya V; Nalliah M
    Heliyon; 2023 Jul; 9(7):e17761. PubMed ID: 37456059
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Non-Preemptive Tree Packing.
    Lendl S; Woeginger G; Wulf L
    Algorithmica; 2023; 85(3):783-804. PubMed ID: 36883187
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 18.