| Article ID: | iaor19912063 |
| Country: | Netherlands |
| Volume: | 31 |
| Issue: | 3 |
| Start Page Number: | 291 |
| End Page Number: | 298 |
| Publication Date: | May 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Olariu S. |
Several efficient algorithms have been proposed to construct a perfect elimination ordering of the vertices of a chordal graph. The paper studies the behaviour of two of these algorithms in relation to a new concept, namely the semi-perfect elimination ordering, which provides a natural generalization of chordal graphs.