Abstract
We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log2 n) time with O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain a parallel algorithm for the permutation representation problem for cographs using O(log n) time with O(n) processors. We also present a parallel algorithm for the depthfirst spanning tree problem for permutation graphs (a class properly contains cographs) which takes O(log2 n) time with O(n) processors.
Research supported by NSF grant CCR-9011214.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, N. Dadoun, D. G. Kirkpatrick and T. Przytycka, A Simple Parallel tree Contraction Algorithm, J. Algorithms 10 (2), 1989, pp. 287–302.
G. S. Adhar and S. Peng, NC Algorithms for Complement Reducible Graphs and Parity Graphs, in Proc. of International Conf. on Comput. and Info., 1989.
G. S. Adhar and S. Peng, Parallel Algorithms for Complement Reducible Graphs and Parity Graphs with Applications, in Proc. Workshop on Algorithms and Data Structures, 1989.
G. S. Adhar and S. Peng, Parallel Algorithms for Cographs and Parity Graphs with Applications, J. Algorithms 11, 1990, pp. 252–284.
G. S. Adhar and S. Peng, Parallel Algorithms for Finding Minimal Path Cover, Hamiltonian Path and Hamiltonian Cycle in Cographs, UMIACS-TR-89-64, Uni. of Maryland, 1989.
R. Cole, Parallel Merge Sort, Proc. 27th IEEE Symposium on Foundation of Computer Science, 1986, pp. 511–517.
D. G. Cornell, H. Lerchs and L. Stewart Burlinham, Complement Reducible Graphs, Disc. Appl. Math. 3, 1981, pp. 163–174.
D. G. Corneil, Y. Perl and L. K. Stewart Burlinham, A Linear Recognition Algorithm for Cographs, SIAM J. on Computing 14 (4), 1985, pp. 926–934.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
D. Helmbold and E. Mayr, Perfect Graphs and Parallel Algorithms, in Proc. 1986 Intl. Conf. on Parallel Processing, pp. 853–860.
H. A. Jung, On a Class of Posets and the Corresponding Comparability Graphs, J. Combinatorial Theory (B) 24, 1978, pp. 125–133.
D. G. Kirkpatrick and T. Przytycka, Parallel Recognition of Complement Reducible Graphs and Cotree Construction, TR 88-1, Department of Computer Science, University of British Columbia, 1988.
Lin and S. Olariu, An NC Algorithm for Cographs, Department of Computer Science, TR-89-32, Old Dominion University, 1989.
M. Novick, Fast Parallel Algorithms for the Modular Decomposition, TR 89-1016, Department of Computer Science, Cornell University, 1989.
D. P. Sumner, Dacey Graphs, J. Australian Math. Soc. 18 (4), 1974, pp. 492–502.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, X. (1992). Parallel algorithm for cograph recognition with applications. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-55706-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55706-7
Online ISBN: 978-3-540-47275-9
eBook Packages: Springer Book Archive