From a simple elimination ordering to a strong elimination ordering in linear time
We present a linear time algorithm for transforming a simple elimination ordering of a strongly chordal graph into a strong elimination ordering. (C) 2003 Elsevier Science B.V. All rights reserved.
simple elimination ordering strong elimination ordering strongly chordal graph graph algorithms graph recognition