Lexicographic Breadth First Search for Chordal Graphs

Abstract

Applied to a chordal graph, lexicographic breadth rst search computes a perfect elimination scheme. We present a short elegant proof for this fact using only a new property of separators in chordal graphs.

Cite this paper

@inproceedings{Simon1994LexicographicBF, title={Lexicographic Breadth First Search for Chordal Graphs}, author={Klaus Simon}, year={1994} }