A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Anne Berry,Romain Pogorelcnik
2011 · DOI: 10.1016/j.ipl.2011.02.013
Information Processing Letters · 29 Citations
TLDR
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 is presented.