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.
167 related articles for article (PubMed ID: 37765887)
1. 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]
2. 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]
3. HSMVS: heuristic search for minimum vertex separator on massive graphs. Luo C; Guo S PeerJ Comput Sci; 2024; 10():e2013. PubMed ID: 38855221 [TBL] [Abstract][Full Text] [Related]
4. Game-Based Memetic Algorithm to the Vertex Cover of Networks. Wu J; Shen X; Jiao K IEEE Trans Cybern; 2019 Mar; 49(3):974-988. PubMed ID: 29994575 [TBL] [Abstract][Full Text] [Related]
5. 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]
6. A Local Search Algorithm with Vertex Weighting Strategy and Two-Level Configuration Checking for the Minimum Connected Dominating Set Problem. Li R; He J; Liu S; Hu S; Yin M Biomimetics (Basel); 2024 Jul; 9(7):. PubMed ID: 39056870 [TBL] [Abstract][Full Text] [Related]
7. 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]
9. A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. Lu Z; Zhou Y; Hao JK IEEE Trans Cybern; 2022 Sep; 52(9):9391-9403. PubMed ID: 33635807 [TBL] [Abstract][Full Text] [Related]
10. Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks. Wong R; Chang WL; Chung WY; Vasilakos AV Sci Rep; 2023 Mar; 13(1):4205. PubMed ID: 36918570 [TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. 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]
14. A Novel Integer-Coded Memetic Algorithm for the Set -Cover Problem in Wireless Sensor Networks. Liao CC; Ting CK IEEE Trans Cybern; 2018 Aug; 48(8):2245-2258. PubMed ID: 28829325 [TBL] [Abstract][Full Text] [Related]
15. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. Nagoor Gani A; Latha SR Springerplus; 2016; 5(1):1854. PubMed ID: 27818892 [TBL] [Abstract][Full Text] [Related]