Decomposition by maxclique separators

DOI10.1016/j.disc.2014.07.020zbMath1301.05260OpenAlexW2168068220MaRDI QIDQ465285

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

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 decompositionmaximal cliqueclique separator

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition by clique separators
• Intersection graphs of paths in a tree
• Simplicial decompositions of graphs: A survey of applications
• Efficient graph representations
• An introduction to clique minimal separator decomposition
• Optimal decomposition by clique separators
• Algorithmic Aspects of Vertex Elimination on Graphs

This page was built for publication: Decomposition by maxclique separators