On some simplicial elimination schemes for chordal graphs

Michel Habib (1) , Vincent Limouzy (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 DCS - Department of Computer Science [University of Toronto]

We present here some results on particular elimination schemes for chordal graphs, namely we show that for any chordal graph we can construct in linear time a simplicial elimination scheme starting with a pending maximal clique attached via a minimal separator maximal (resp. minimal) under inclusion among all minimal separators.

Domaines: Algorithme et structure de données [cs.DS]

Michel Habib, Vincent Limouzy. On some simplicial elimination schemes for chordal graphs. 2008. ⟨hal-00353959v2⟩