Abstract
We consider two problems pertaining to P 4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P 4-comparability graph and the problem of producing an acyclic P 4-transitive orientation of a P 4-comparability graph. These problems have been considered by Hoáng and Reed who described O(n 4) and O(n 5)-time algorithms for their solution respectively, where n is the number of vertices of the given graph. Recently, Raschle and Simon described O(n + m 2)-time algorithms for these problems, where m is the number of edges of the graph. In this paper, we describe difierent O(n + m 2)-time algorithms for the recognition and the acyclic P 4-transitive orientation problems on P 4- comparability graphs. Instrumental in these algorithms are structural relationships of the P 4-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 effcient parallelization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Babel and S. Olariu, A new characterization of P4-connected graphs, Proc. 22nd International Workshop on Graph-theoretic concepts in Computer Science (WG’ 96) (F. d’Amore, P. G. Franciosa, and A. Marchetti-Spaccamela, eds.), LNCS 1197, 1996, 17–30.
C. M. H. de Figueiredo, J. Gimbel, C. P. Mello, and J. L. Szwarcfiter, Even and odd pairs in comparability and in P 4-comparability graphs, Discrete Appl. Math. 91 (1999), 293–297.
P. C. Gilmore and A. J. Hoffman, A characterization of comparability graphs and of interval graphs, Canad. J. Math. 16 (1964), 539–548.
M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, Inc., New York, 1980.
C. T. Hoáng and B. A. Reed, Some classes of perfectly orderable graphs, J. Graph Theory 13 (1989), 445–463.
C. T. Hoáng and B. A. Reed, P 4-comparability graphs, Discrete Math. 74 (1989), 173–200.
R. M. McConnell and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (1994), 536–545.
R. M. McConnell and J. Spinrad, Linear-time transitive orientation, Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (1997), 19–25.
S. D. Nikolopoulos and L. Palios, Recognition and orientation algorithms for P 4-comparability graphs, Technical Report 23-00, 2000, University of Ioannina, Ioannina,Greece.
S. D. Nikolopoulos and L. Palios, Parallel algorithms for P 4-comparability graphs, Technical Report 20-01, 2001, University of Ioannina, Ioannina, Greece.
T. Raschle and K. Simon, On the P 4-components of graphs, Discrete Appl. Math. 100 (2000), 215–235.
J. P. Spinrad, On comparability and permutation graphs, SIAM J. on Comput. 14 (1985), 658–670.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikolopoulos, S.D., Palios, L. (2001). Recognition and Orientation Algorithms for P4-Comparability Graphs. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_28
Download citation
DOI: https://doi.org/10.1007/3-540-45678-3_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42985-2
Online ISBN: 978-3-540-45678-0
eBook Packages: Springer Book Archive