Clique Covering of Graphs IV. Algorithms

DOI10.1137/0213005MaRDI QIDQ3340897zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clique partitionlinear time algorithmclique covering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

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; zbMATH DE number 4134090
• An improved upper bound and algorithm for clique covers
• The complexity of generalized clique covering

Cited in

(12)

• ℱ-WORM colorings of some 2-trees: partition vectors
• Graph theory (algorithmic, algebraic, and metric problems)
• An overview of graph covering and partitioning
• Applications of edge coverings by cliques
• Data reduction and exact algorithms for clique cover
• On cycle graphs
• On dimensional properties of graphs
• The clique-partitioning problem
• Edge clique partition in \((k,\ell)\)-graphs
• Fast constructive and improvement heuristics for edge clique covering
• Induced cycles in triangle graphs
• Clique covering and clique partition in generalizations of line graphs

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)