Clique Covering of Graphs IV. Algorithms
From MaRDI portal
Publication:3340897
DOI10.1137/0213005zbMath0548.05050MaRDI QIDQ3340897
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
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C99: Graph theory
Related Items
Graph theory (algorithmic, algebraic, and metric problems), Applications of edge coverings by cliques, The clique-partitioning problem, On dimensional properties of graphs, Clique covering and clique partition in generalizations of line graphs