Decomposition by maxclique separators

DOI10.1016/J.DISC.2014.07.020zbMATH Open1301.05260OpenAlexW2168068220MaRDI QIDQ465285FDOQ465285

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

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

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)

Cites Work

• Graph theory
• Decomposition by clique separators
• Intersection graphs of paths in a tree
• Efficient graph representations
• Optimal decomposition by clique separators
• Algorithmic Aspects of Vertex Elimination on Graphs
• An introduction to clique minimal separator decomposition
• Simplicial decompositions of graphs: A survey of applications
• Title not available (Why is that?)

Cited In (5)

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

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)