An algorithm for the decomposition of graphs into cliques

DOI10.1002/JGT.3190200208zbMATH Open0837.05107OpenAlexW2070599422MaRDI QIDQ4852404

Xiang-Ying Su

Publication date: 31 October 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200208

zbMATH Keywords

decompositionpolynomial time algorithmcliques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

Cites Work

• The Representation of a Graph by Set Intersections

Related Items (4)

The symmetric (2k, k)-graphs ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: An algorithm for the decomposition of graphs into cliques