Assignment-minimum clique coverings

DOI10.1145/2133803.2275596zbMath1284.05214OpenAlexW2003432689MaRDI QIDQ5406263

Daniel M. Ennis, Charles M. Fayle, John M. Ennis

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2133803.2275596

zbMATH Keywords

applied statisticsclique coverletter displays

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Large-scale clique cover of real-world networks

This page was built for publication: Assignment-minimum clique coverings