Clique Covering of Graphs IV. Algorithms
From MaRDI portal
Publication:3340897
DOI10.1137/0213005zbMATH Open0548.05050OpenAlexW2025967594MaRDI QIDQ3340897FDOQ3340897
Authors: Norman J. Pullman 
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0213005
Recommendations
- Clique covering of graphs
- Covering the cliques of a graph with vertices
- scientific article; zbMATH DE number 3762108
- scientific article; zbMATH DE number 68359
- Approximation Algorithms for the k-Clique Covering Problem
- Clique covers and coloring problems of graphs
- Covering all cliques of a graph
- scientific article
- An improved upper bound and algorithm for clique covers
- The complexity of generalized clique covering
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Cited In (13)
- An overview of graph covering and partitioning
- Data reduction and exact algorithms for clique cover
- ℱ-WORM colorings of some 2-trees: partition vectors
- Edge clique partition in \((k,\ell)\)-graphs
- Fast constructive and improvement heuristics for edge clique covering
- On the complete width and edge clique cover problems
- Induced cycles in triangle graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- Clique covering and clique partition in generalizations of line graphs
- On cycle graphs
- On dimensional properties of graphs
- The clique-partitioning problem
- Applications of edge coverings by cliques
This page was built for publication: Clique Covering of Graphs IV. Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340897)
