Discrete Mathematics - Graph colouring and variations
Even and odd pairs in comparability and in P4-comparability graphs
Discrete Applied Mathematics
Linear-time transitive orientation
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A New Characterization of P4-connected Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of a P4-comparability graph. These problems have been considered by Hoàng and Reed who described O(n4) and O(n5)-time algorithms for their solution respectively, where n is the number of vertices of the given graph. Recently, Raschle and Simon described O(n + m2)-time algorithms for these problems, where m is the number of edges of the graph. In this paper, we describe different O(n + m2)-time algorithms for the recognition and the acyclic P4-transitive orientation problems on P4- comparability graphs. Instrumental in these algorithms are structural relationships of the P4-components of a graph, which we establish and which are interesting in their own right. Our algorithms are simple, use simple data structures, and have the advantage over those of Raschle and Simon in that they are non-recursive, require linear space and admit efficient parallelization.