Analysis of Iterated Greedy Heuristic for Vertex Clique Covering
From MaRDI portal
Publication:5145716
DOI10.4149/cai_2018_2_385zbMath1504.68155OpenAlexW2803833216MaRDI QIDQ5145716
Publication date: 21 January 2021
Published in: Computing and Informatics (Search for Journal in Brave)
Full work available at URL: https://hull-repository.worktribe.com/output/444539
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)