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

Anne Berry (1) , Romain Pogorelcnik (1)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

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.

Mots clés: MCS; LexBFS; minimal separator; maximal clique; chordal graph

Domaines: Mathématique discrète [cs.DM]

Anne Berry, Romain Pogorelcnik. A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph. Information Processing Letters, 2011, 111 (11), pp.Pages 508-511. ⟨10.1016/j.ipl.2011.02.013⟩. ⟨hal-00678694⟩