Clique Cover on Sparse Networks

DOI10.1137/1.9781611972924.10zbMath1429.68178OpenAlexW1895255764MaRDI QIDQ5233722

Adrian Vetta, Ethan Kim, Mathieu Blanchette

Publication date: 12 September 2019

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

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

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Systems biology, networks (92C42)

Related Items (7)

An overview of graph covering and partitioning ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Unnamed Item ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Bandwidth of graphs resulting from the edge clique covering problem ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ Revising Johnson's table for the 21st century

This page was built for publication: Clique Cover on Sparse Networks