Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Theory and Algorithms
A Linear-Time Recognition Algorithm For P4-Reducible Graphs, B. Jamison, S. Olariu
A Linear-Time Recognition Algorithm For P4-Reducible Graphs, B. Jamison, S. Olariu
Computer Science Faculty Publications
The P4-reducible graphs are a natural generalization of the well-known class of cographs, with applications to scheduling, computational semantics, and clustering. More precisely, the P4-reducible graphs are exactly the graphs none of whose vertices belong to more than one chordless path with three edges. A remarkable property of P4-reducible graphs is their unique tree representation up to isomorphism. In this paper we present a linear-time algorithm to recognize P4-reducible graphs and to construct their corresponding tree representation.