Abstract
We design efficient parallel algorithms for solving several problems on interval graphs. The problems include finding a BFS-tree and DFS-tree, articulation points and bridges, and minimum coloring. Each of our algorithms requires O(log n) time employing O(n) processors on the EREW PRAM model, where n is the number of vertices. The proposed algorithms for computing articulation points and bridges have better performance in terms of the cost (i.e, processor-time product) than the existing algorithms in [RR90], yet having the same time complexity. Our novel approach to the construction of BFS tree is based on elegantly capturing the structure of a given collection of intervals. This structure reveals important properties of the corresponding interval graph, and is found to be instrumental in solving many other problems on such graphs. Although the time- and processor-complexities of the proposed DFS-tree construction or minimum-coloring is comparable with the best-known ones [KI89], our approach to these problems are new. For example, the approach to the construction of a DFS tree is based on reducing the problem into an all dominating neighbors (ADN) problem; while that to the minimum coloring is by transforming this problem into a linked list ranking problem.
This work is supported by Texas Advanced Research Program grant under Award No. 003594003. The authors can be reached via e-mail at das@ponder.csci.unt.edu
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, “A Simple Parallel Contraction Algorithm,” J. Algorithms, Vol. 10, 1989, pp. 287–302.
A. A. Bertossi and M. A. Bonuccelli, “Some Parallel Algorithms on Interval Graph,” Discr. Appl. Math., Vol. 16, 1987, pp. 101–111.
O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin, “Highly Parallelizable Problems,” Proc. 21st ACM Symp. Theo. Comput., 1989, pp. 309–319.
C. C.-Y. Chen and S. K. Das, “A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAM,” Proc. Int. Parallel Process. Symp., Anaheim, California, May 1991, pp. 132–137.
C. C.-Y. Chen and S. K. Das, “Breadth-First Traversal of Trees and Integer Sorting in Parallel,” Inform. Process. Lett., Vol. 41, No. 1, pp. 39–49, Jan. 1992.
C. C.-Y. Chen, S. K. Das, and S. G. Akl, “A Unified Approach to Parallel Depth-First Traversais of General Trees,” Inform. Process. Lett., Vol. 38, No. 1, pp. 49–55, Apr. 1991.
R. Cole, “Parallel Merge Sort,” SIAM J. Comput., Vol. 17, 1988, pp. 770–785.
R. Cole and U. Vishkin, “Approximate Parallel Scheduling. Part I: the Basic Technique with Application to Optimal Parallel List Ranking in Logarithmic Time,” SIAM J. Comput., Vol. 17, 1988, pp. 128–142.
E. Dekel and S. Sahni, “E. Dekel and S. Sahni, “Parallel Scheduling Algorithms,” Operations Research, Vol. 31, No. 1, 1983, pp. 24–49.
U. I. Gupta, D. T. Lee, and J. Y.-T. Leung, “An Optimal Solution for the Channel-Assignment Problem,” IEEE Trans. Comput., Vol. C-28, No. 11, Nov. 1979, pp. 807–810.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
S. K. Kim, “Optimal Parallel Algorithms on Sorted Intervals,” Proc. 27th Annu. Allerton Conf. Commun., Control and Comput., Vol. I, 1989, pp. 766–775.
D. G. Kirkpatrick and T. Przytycka, “An Optimal Minimax Tree Algorithm,” IEEE Symp. Parallel and Distr. Process., Dallas, Texas, Dec. 1990, pp. 293–300.
A. Moitra and R. Johnson, “PT-Optimal Algorithms for Interval Graphs,” Proc. 26th Annu. Allerton Conf. Commun., Control and Comput., Vol. I, Illinois, 1988, pp. 274–282.
S. Olariu, J. L. Schwing, and J. Zhang, “Optimal Parallel Algorithms for Problems Modelled by a Family of Intervals,” Proc. 28th Annu. Allerton Conf. Commun., Control and Comput., 1990, pp. 282–291.
F. Roberts, Discrete Mathematical Models, Prentice-Hall, Englewood Cliff, New Jersey, 1976.
G. D. S. Ramkumar and C. P. Rangan, “Parallel Algorithms on Interval Graphs,” Proc. Int. Conf. Parallel Process., Aug. 1990, pp. 72–74.
M. A. Sridhar and S. Goyal, “Efficient Parallel Computation of Hamiltonian Paths and Circuits in Interval Graph,” Proc. Int. Conf. Parallel Process., Vol. III, Aug. 1991, pp. 83–90.
F. Springsteel and I. Stojmenovic, “Parallel General Prefix Computation with Geometric, Algebraic, and Other Applications,” Int. J. Parallel Programming, Vol. 18, No. 6, 1989, pp. 485–503.
Y. Shiloach and U. Vishkin, “Finding the Maximum, Merging and Sorting in a Parallel Computation Model,” J. Algorithms, Vol. 2, 1981, pp. 88–102.
R. E. Tarjan and U. Vishkin, “An Efficient Parallel Biconnectivity Algortihm,” SIAM J. Comput., Vol. 14, Nov. 1985, pp. 862–874.
M. S. Yu, C. L. Chen, and R. C. T. Lee, “An Optimal Parallel Algorithm for Minimum Coloring of Intervals,” Proc. Int. Conf. Parallel Process., Vol. III, Aug. 1990, pp. 162–168.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, S.K., Chen, C.C.Y. (1992). Efficient parallel algorithms on interval graphs. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_85
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive