Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

DOI10.1137/1.9781611972863.9zbMath1428.68216OpenAlexW2102948402MaRDI QIDQ5233468

Rolf Niedermeier, Jiong Guo, Jens Gramm, Falk Hüffner

Publication date: 11 September 2019

Published in: 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972863.9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (17)

Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ On the intractability landscape of digraph intersection representations ⋮ Pairs Covered by a Sequence of Sets ⋮ Elements of Fuzzy Logic in Solving Clustering Problems ⋮ Unnamed Item ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ Clustering with Partial Information ⋮ On the complete width and edge clique cover problems ⋮ Large-scale clique cover of real-world networks ⋮ Редукция графа при поиске реберного покрытия минимальным числом клик ⋮ Covering Graphs with Few Complete Bipartite Subgraphs ⋮ Covering graphs with few complete bipartite subgraphs ⋮ Algorithms for compact letter displays: comparison and evaluation ⋮ Kernelization: New Upper and Lower Bound Techniques ⋮ Unnamed Item ⋮ A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

This page was built for publication: Data Reduction, Exact, and Heuristic Algorithms for Clique Cover