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 *

122 related articles for article (PubMed ID: 35880199)

  • 1. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Splitting Vertices in 2-Layer Graph Drawings.
    Ahmed R; Angelini P; Bekos MA; Battista GD; Kaufmann M; Kindermann P; Kobourov S; Nollenburg M; Symvonis A; Villedieu A; Wallinger M
    IEEE Comput Graph Appl; 2023; 43(3):24-35. PubMed ID: 37023163
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs.
    Liu C; Song Y
    J Comb Optim; 2010 Apr; 20(2):1-15. PubMed ID: 23874144
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Relating Vertex and Global Graph Entropy in Randomly Generated Graphs.
    Tee P; Parisis G; Berthouze L; Wakeman I
    Entropy (Basel); 2018 Jun; 20(7):. PubMed ID: 33265571
    [TBL] [Abstract][Full Text] [Related]  

  • 6. The local vertex anti-magic coloring for certain graph operations.
    Uma L; Rajasekaran G
    Heliyon; 2024 Jul; 10(13):e33400. PubMed ID: 39044974
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Computing The Energy of Certain Graphs based on Vertex Status.
    Khurshid A; Salman M
    Curr Org Synth; 2023 Aug; ():. PubMed ID: 37581326
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Reconfiguring Shortest Paths in Graphs.
    Gajjar K; Jha AV; Kumar M; Lahiri A
    Algorithmica; 2024; 86(10):3309-3338. PubMed ID: 39359538
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Parameterized Complexity of Directed Spanner Problems.
    Fomin FV; Golovach PA; Lochet W; Misra P; Saurabh S; Sharma R
    Algorithmica; 2022; 84(8):2292-2308. PubMed ID: 35880198
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Tangled piecewise-linear embeddings of trivalent graphs.
    O'Keeffe M; Treacy MMJ
    Acta Crystallogr A Found Adv; 2022 Mar; 78(Pt 2):128-138. PubMed ID: 35230268
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Graph Matching between Bipartite and Unipartite Networks: to Collapse, or not to Collapse, that is the Question.
    Arroyo J; Priebe CE; Lyzinski V
    IEEE Trans Netw Sci Eng; 2021; 8(4):3019-3033. PubMed ID: 35224127
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On Finding and Enumerating Maximal and Maximum
    Phillips CA; Wang K; Baker EJ; Bubier JA; Chesler EJ; Langston MA
    Algorithms; 2019 Jan; 12(1):. PubMed ID: 31448059
    [TBL] [Abstract][Full Text] [Related]  

  • 15. (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
    Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X
    VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Co-Clustering on Bipartite Graphs for Robust Model Fitting.
    Lin S; Luo H; Yan Y; Xiao G; Wang H
    IEEE Trans Image Process; 2022; 31():6605-6620. PubMed ID: 36256709
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Graph automorphism perception algorithms in computer-enhanced structure elucidation.
    Razinger M; Balasubramanian K; Munk ME
    J Chem Inf Comput Sci; 1993; 33(2):197-201. PubMed ID: 8314927
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Distributed Optimization for Graph Matching.
    Van Tran Q; Sun Z; D O Anderson B; Ahn HS
    IEEE Trans Cybern; 2023 Aug; 53(8):4815-4828. PubMed ID: 35081034
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Complexity of Secure Sets.
    Bliem B; Woltran S
    Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.