On some simplicial elimination schemes for chordal graphs
Data Structures and Algorithms
2009-02-17 v2
Abstract
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.
Cite
@article{arxiv.0901.2645,
title = {On some simplicial elimination schemes for chordal graphs},
author = {Michel Habib and Vincent Limouzy},
journal= {arXiv preprint arXiv:0901.2645},
year = {2009}
}