An algorithm for the decomposition of graphs into cliques

DOI10.1002/JGT.3190200208MaRDI QIDQ4852404zbMATH OpenOpenAlexFDO

Authors 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

cliquesdecompositionpolynomial time algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1792630
• Decomposition by maxclique separators
• Decomposition by maxclique separators
• Greedy maximum-clique decompositions
• The greedy clique decomposition of a graph

Cites work

• The Representation of a Graph by Set Intersections

Cited in

(6)

• The symmetric (2k, k)-graphs
• scientific article; zbMATH DE number 6093217 (Why is no real title available?)
• scientific article; zbMATH DE number 4139786 (Why is no real title available?)
• Organizing the atoms of the clique separator decomposition into an atom tree
• Clique parts independent of remainders
• scientific article; zbMATH DE number 1792630 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852404)