A Linear-Time Recognition Algorithm for P4-Reducible Graphs

Authors

B. Jamison, Old Dominion University
S. Olariu, Old Dominion UniversityFollow

Document Type

Article

Publication Date

1995

DOI

10.1016/0304-3975(95)00016-p

Publication Title

Theoretical Computer Science

Volume

145

Issue

1-2

Pages

329-344

Abstract

The P₄-reducible graphs are a natural generalization of the well-known class of cographs, with applications to scheduling, computational semantics, and clustering. More precisely, the P₄-reducible graphs are exactly the graphs none of whose vertices belong to more than one chordless path with three edges. A remarkable property of P₄-reducible graphs is their unique tree representation up to isomorphism. In this paper we present a linear-time algorithm to recognize P₄-reducible graphs and to construct their corresponding tree representation.

Comments

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

Original Publication Citation

Jamison, B., & Olariu, S. (1995). A linear-time recognition algorithm for P₄-reducible graphs. Theoretical Computer Science, 145(1-2), 329-344. doi:10.1016/0304-3975(95)00016-p

Repository Citation

Jamison, B., & Olariu, S. (1995). A linear-time recognition algorithm for P₄-reducible graphs. Theoretical Computer Science, 145(1-2), 329-344. doi:10.1016/0304-3975(95)00016-p

ORCID

0000-0002-3776-216X (Olariu)