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 *

108 related articles for article (PubMed ID: 34271758)

  • 1. Long-loop feedback vertex set and dismantling on bipartite factor graphs.
    Li T; Zhang P; Zhou HJ
    Phys Rev E; 2021 Jun; 103(6):L061302. PubMed ID: 34271758
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Network dismantling.
    Braunstein A; Dall'Asta L; Semerjian G; Zdeborová L
    Proc Natl Acad Sci U S A; 2016 Nov; 113(44):12368-12373. PubMed ID: 27791075
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Fast and simple decycling and dismantling of networks.
    Zdeborová L; Zhang P; Zhou HJ
    Sci Rep; 2016 Nov; 6():37954. PubMed ID: 27897223
    [TBL] [Abstract][Full Text] [Related]  

  • 4. TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs.
    Zhang Y; Wang S; Liu C; Zhu E
    Sensors (Basel); 2023 Sep; 23(18):. PubMed ID: 37765887
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Spin-glass phase transitions and minimum energy of the random feedback vertex set problem.
    Qin SM; Zeng Y; Zhou HJ
    Phys Rev E; 2016 Aug; 94(2-1):022146. PubMed ID: 27627285
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Dynamic thresholding search for the feedback vertex set problem.
    Sun W; Hao JK; Wu Z; Li W; Wu Q
    PeerJ Comput Sci; 2023; 9():e1245. PubMed ID: 37346631
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Tensor Network Message Passing.
    Wang Y; Zhang YE; Pan F; Zhang P
    Phys Rev Lett; 2024 Mar; 132(11):117401. PubMed ID: 38563954
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Solving the non-submodular network collapse problems via Decision Transformer.
    Ma K; Yang H; Yang S; Zhao K; Li L; Chen Y; Huang J; Cheng J; Rong Y
    Neural Netw; 2024 Aug; 176():106328. PubMed ID: 38688067
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Neural extraction of multiscale essential structure for network dismantling.
    Liu Q; Wang B
    Neural Netw; 2022 Oct; 154():99-108. PubMed ID: 35872517
    [TBL] [Abstract][Full Text] [Related]  

  • 11. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Socio-ecological network structures from process graphs.
    Lao A; Cabezas H; Orosz Á; Friedler F; Tan R
    PLoS One; 2020; 15(8):e0232384. PubMed ID: 32750052
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Relations between ordinary energy and energy of a self-loop graph.
    Rakshith BR; Das KC; Manjunatha BJ; Shang Y
    Heliyon; 2024 Mar; 10(6):e27756. PubMed ID: 38509879
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. A Message-Passing Algorithm for Wireless Network Scheduling.
    Paschalidis IC; Huang F; Lai W
    IEEE ACM Trans Netw; 2015 Oct; 23(5):1528-1541. PubMed ID: 26752942
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Generalized network dismantling.
    Ren XL; Gleinig N; Helbing D; Antulov-Fantulin N
    Proc Natl Acad Sci U S A; 2019 Apr; 116(14):6554-6559. PubMed ID: 30877241
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Sequence Alignment on Directed Graphs.
    Kavya VNS; Tayal K; Srinivasan R; Sivadasan N
    J Comput Biol; 2019 Jan; 26(1):53-67. PubMed ID: 30204489
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Graph Simplification-Aided ADMM for Decentralized Composite Optimization.
    Wang B; Fang J; Duan H; Li H
    IEEE Trans Cybern; 2021 Oct; 51(10):5170-5183. PubMed ID: 31831456
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.