Assignment-minimum clique coverings
DOI10.1145/2133803.2275596zbMATH Open1284.05214OpenAlexW2003432689MaRDI QIDQ5406263FDOQ5406263
Authors: Charles M. Fayle, Daniel M. Ennis, J. 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
Recommendations
- Methods of finding all minimum coverings of a graph by cliques
- scientific article; zbMATH DE number 1545697
- Graph reduction in the construction of minimal clique cover
- Clique covering of graphs
- scientific article; zbMATH DE number 1463390
- Covering the cliques of a graph with vertices
- scientific article; zbMATH DE number 522858
- Minimum \((n,k,t)\) clique graphs
- scientific article; zbMATH DE number 68359
- Minimum weighted clique cover on claw‐free perfect graphs
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (8)
- Methods of finding all minimum coverings of a graph by cliques
- Construction of near-optimal vertex clique covering for real-world networks
- Large-scale clique cover of real-world networks
- Data reduction, exact, and heuristic algorithms for clique cover
- Optimal partial clique edge covering guided by potential energy minimization
- Graph reduction in the construction of minimal clique cover
- Applications of edge coverings by cliques
- Effective data reduction for the vertex clique cover problem
This page was built for publication: Assignment-minimum clique coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406263)
