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 *

116 related articles for article (PubMed ID: 37420372)

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

  • 2. A spectral graph convolution for signed directed graphs via magnetic Laplacian.
    Ko T; Choi Y; Kim CK
    Neural Netw; 2023 Jul; 164():562-574. PubMed ID: 37216757
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Self-adjoint and Markovian extensions of infinite quantum graphs.
    Kostenko A; Mugnolo D; Nicolussi N
    J Lond Math Soc; 2022 Mar; 105(2):1262-1313. PubMed ID: 35912286
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Intrinsic graph structure estimation using graph Laplacian.
    Noda A; Hino H; Tatsuno M; Akaho S; Murata N
    Neural Comput; 2014 Jul; 26(7):1455-83. PubMed ID: 24708372
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Simple graph models of information spread in finite populations.
    Voorhees B; Ryder B
    R Soc Open Sci; 2015 May; 2(5):150028. PubMed ID: 26064661
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain.
    Pang J; Cheung G
    IEEE Trans Image Process; 2017 Apr; 26(4):1770-1785. PubMed ID: 28092554
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH.
    Linderman GC; Steinerberger S
    Math Comput; 2020; 89(324):1933-1952. PubMed ID: 33927452
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Intrinsic Graph Learning With Discrete Constrained Diffusion-Fusion.
    Wei X; Lu T; Li S
    IEEE Trans Neural Netw Learn Syst; 2023 Mar; 34(3):1613-1626. PubMed ID: 34432641
    [TBL] [Abstract][Full Text] [Related]  

  • 13. On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree.
    Guo SG; Zhang R
    J Inequal Appl; 2017; 2017(1):120. PubMed ID: 28603399
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Revisiting Viewing Graph Solvability: an Effective Approach Based on Cycle Consistency.
    Arrigoni F; Fusiello A; Rizzi R; Ricci E; Pajdla T
    IEEE Trans Pattern Anal Mach Intell; 2022 Oct; PP():. PubMed ID: 36215371
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Consensus of Positive Networked Systems on Directed Graphs.
    Liu JJR; Kwok KW; Cui Y; Shen J; Lam J
    IEEE Trans Neural Netw Learn Syst; 2022 Sep; 33(9):4575-4583. PubMed ID: 33646958
    [TBL] [Abstract][Full Text] [Related]  

  • 17. On the spectrum, energy and Laplacian energy of graphs with self-loops.
    Preetha P U; Suresh M; Bonyah E
    Heliyon; 2023 Jul; 9(7):e17001. PubMed ID: 37415950
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

    [Next]    [New Search]
    of 6.