Some Aspects of the Semi-Perfect Elimination

Authors

Stephan Olariu, Old Dominion UniversityFollow

Document Type

Article

Publication Date

1991

DOI

10.1016/0166-218x(91)90056-3

Publication Title

Discrete Applied Mathematics

Volume

31

Issue

3

Pages

291-298

Abstract

Several efficient algorithms have been proposed to construct a perfect elimination ordering of the vertices of a chordal graph. We study 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.

Comments

Elsevier open archive. Copyright © 1991 Published by Elsevier B.V. All rights reserved.

Original Publication Citation

Olariu, S. (1991). Some aspects of the semiperfect elimination. Discrete Applied Mathematics, 31(3), 291-298. doi:10.1016/0166-218x(91)90056-3

Repository Citation

Olariu, S. (1991). Some aspects of the semiperfect elimination. Discrete Applied Mathematics, 31(3), 291-298. doi:10.1016/0166-218x(91)90056-3

ORCID

0000-0002-3776-216X (Olariu)