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 *

180 related articles for article (PubMed ID: 35111921)

  • 1. Graph coloring using the reduced quantum genetic algorithm.
    Ardelean SM; Udrescu M
    PeerJ Comput Sci; 2022; 8():e836. PubMed ID: 35111921
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
    Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ
    Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem.
    Qian W; Basili RAM; Eshaghian-Wilner MM; Khokhar A; Luecke G; Vary JP
    Entropy (Basel); 2023 Aug; 25(8):. PubMed ID: 37628268
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Automatically generated algorithms for the vertex coloring problem.
    Contreras Bolton C; Gatica G; Parada V
    PLoS One; 2013; 8(3):e58551. PubMed ID: 23516506
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem.
    Chang WL; Wong R; Chen YH; Chung WY; Chen JC; Vasilakos AV
    IEEE Trans Nanobioscience; 2024 Jul; 23(3):499-506. PubMed ID: 38687648
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A DNA algorithm for the graph coloring problem.
    Liu W; Zhang F; Xu J
    J Chem Inf Comput Sci; 2002; 42(5):1176-8. PubMed ID: 12377006
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.
    Chang WL; Chen JC; Chung WY; Hsiao CY; Wong R; Vasilakos AV
    IEEE Trans Nanobioscience; 2021 Jul; 20(3):354-376. PubMed ID: 33900920
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Implementing Graph-Theoretic Feature Selection by Quantum Approximate Optimization Algorithm.
    Li Y; Zhou RG; Xu R; Luo J; Hu W; Fan P
    IEEE Trans Neural Netw Learn Syst; 2024 Feb; 35(2):2364-2377. PubMed ID: 35862330
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Graph Coloring Algorithm for Large Scheduling Problems.
    Leighton FT
    J Res Natl Bur Stand (1977); 1979; 84(6):489-506. PubMed ID: 34880531
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Locust Inspired Algorithm for Cloudlet Scheduling in Cloud Computing Environments.
    Ala'anzy MA; Othman M; Hanapi ZM; Alrshah MA
    Sensors (Basel); 2021 Nov; 21(21):. PubMed ID: 34770615
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Transforming graph states using single-qubit operations.
    Dahlberg A; Wehner S
    Philos Trans A Math Phys Eng Sci; 2018 Jul; 376(2123):. PubMed ID: 29807902
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm.
    Martín H JA
    PLoS One; 2013; 8(1):e53437. PubMed ID: 23349711
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Energy function-based approaches to graph coloring.
    Di Blas A; Jagota A; Hughey R
    IEEE Trans Neural Netw; 2002; 13(1):81-91. PubMed ID: 18244411
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Ramsey numbers and adiabatic quantum computing.
    Gaitan F; Clark L
    Phys Rev Lett; 2012 Jan; 108(1):010501. PubMed ID: 22304248
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Vertex coloring of graphs via phase dynamics of coupled oscillatory networks.
    Parihar A; Shukla N; Jerry M; Datta S; Raychowdhury A
    Sci Rep; 2017 Apr; 7(1):911. PubMed ID: 28424457
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
    Zhu E; Jiang F; Liu C; Xu J
    IEEE Trans Cybern; 2022 Jun; 52(6):4960-4969. PubMed ID: 33108304
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.