Analysis of Iterated Greedy Heuristic for Vertex Clique Covering

DOI10.4149/cai_2018_2_385zbMath1504.68155MaRDI QIDQ5145716

David Chalupa, Jiři Pospíchal

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

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)