Decomposition by maxclique separators

DOI10.1016/J.DISC.2014.07.020MaRDI QIDQ465285zbMATH OpenOpenAlexFDO

Authors Márcia R. Cerioli, Hugo Nobrega, Petrucio Viana

Publication date 31 October 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2014.07.020

zbMATH Keywords

algorithmgraph decompositionclique separatormaximal clique

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposition by maxclique separators
• Optimal decomposition by clique separators
• scientific article; zbMATH DE number 4016952
• Decomposition by clique separators
• Revisiting decomposition by clique separators

Cites work

• scientific article; zbMATH DE number 48089 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• An introduction to clique minimal separator decomposition
• Decomposition by clique separators
• Efficient graph representations
• Graph theory
• Intersection graphs of paths in a tree
• Optimal decomposition by clique separators
• Simplicial decompositions of graphs: A survey of applications

Cited in

(5)

• An algorithm for the decomposition of graphs into cliques
• Decomposition by clique separators
• Decomposition by maxclique separators
• An introduction to clique minimal separator decomposition
• Revisiting decomposition by clique separators

This page was built for publication: Decomposition by maxclique separators

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