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 *

123 related articles for article (PubMed ID: 34780522)

  • 21. Recent developments in quantitative graph theory: information inequalities for networks.
    Dehmer M; Sivakumar L
    PLoS One; 2012; 7(2):e31395. PubMed ID: 22355362
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Closed trail distance in a biconnected graph.
    Snasel V; Drazdilova P; Platos J
    PLoS One; 2018; 13(8):e0202181. PubMed ID: 30169516
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. Classifying Dissemination Processes in Temporal Graphs.
    Oettershagen L; Kriege NM; Morris C; Mutzel P
    Big Data; 2020 Oct; 8(5):363-378. PubMed ID: 33090027
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Continuous facility location on graphs.
    Hartmann TA; Lendl S; Woeginger GJ
    Math Program; 2022; 192(1-2):207-227. PubMed ID: 35300152
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Infinite Ergodic Walks in Finite Connected Undirected Graphs.
    Volchenkov D
    Entropy (Basel); 2021 Feb; 23(2):. PubMed ID: 33567624
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.
    Shang Y
    PLoS One; 2015; 10(3):e0123426. PubMed ID: 25822506
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Flip Distances Between Graph Orientations.
    Aichholzer O; Cardinal J; Huynh T; Knauer K; Mütze T; Steiner R; Vogtenhuber B
    Algorithmica; 2021; 83(1):116-143. PubMed ID: 33583986
    [TBL] [Abstract][Full Text] [Related]  

  • 29. On Edge Exchangeable Random Graphs.
    Janson S
    J Stat Phys; 2018; 173(3):448-484. PubMed ID: 30930480
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Brain graph super-resolution for boosting neurological disorder diagnosis using unsupervised multi-topology connectional brain template learning.
    Mhiri I; Khalifa AB; Mahjoub MA; Rekik I
    Med Image Anal; 2020 Oct; 65():101768. PubMed ID: 32679534
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. Incremental isometric embedding of high-dimensional data using connected neighborhood graphs.
    Zhao D; Yang L
    IEEE Trans Pattern Anal Mach Intell; 2009 Jan; 31(1):86-98. PubMed ID: 19029548
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Distributed Bounds on the Algebraic Connectivity of Graphs With Application to Agent Networks.
    Xiuxian Li ; Chen MZQ; Housheng Su ; Chanying Li
    IEEE Trans Cybern; 2017 Aug; 47(8):2121-2131. PubMed ID: 27608483
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Random line graphs and a linear law for assortativity.
    Liu D; Trajanovski S; Van Mieghem P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jan; 87(1):012816. PubMed ID: 23410397
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Statistical test for detecting community structure in real-valued edge-weighted graphs.
    Tokuda T
    PLoS One; 2018; 13(3):e0194079. PubMed ID: 29558487
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Violating the Shannon capacity of metric graphs with entanglement.
    Briët J; Buhrman H; Gijswijt D
    Proc Natl Acad Sci U S A; 2013 Nov; 110(48):19227-32. PubMed ID: 23267109
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Graph Indices for Cartesian Product of -sum of Connected Graphs.
    Liu JB; Imran M; Baby S; Siddiqui HMA; Shafiq MK
    Comb Chem High Throughput Screen; 2022; 25(3):528-535. PubMed ID: 33596795
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Renyi entropy driven hierarchical graph clustering.
    Oggier F; Datta A
    PeerJ Comput Sci; 2021; 7():e366. PubMed ID: 33817016
    [TBL] [Abstract][Full Text] [Related]  

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

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

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