A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph

Authors:
Anne Berry;Romain Pogorelcnik
Affiliations:
LIMOS UMR CNRS 6158, Ensemble Scientifique des Cézeaux, F-63 173 Aubière, France;LIMOS UMR CNRS 6158, Ensemble Scientifique des Cézeaux, F-63 173 Aubière, France
Venue:
Information Processing Letters
Year:
2011

Citing 5
Cited 1

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Separability generalizes Dirac's theorem

Discrete Applied Mathematics
Minimal vertex separators of chordal graphs

Discrete Applied Mathematics
A Unified View of Graph Searching

SIAM Journal on Discrete Mathematics
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings

SIAM Journal on Discrete Mathematics

Moplex orderings generated by the LexDFS algorithm

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a simple unified algorithmic process which uses either LexBFS or MCS on a chordal graph to generate the minimal separators and the maximal cliques in linear time in a single pass.