A parallel maximal cliques algorithm for interval graphs with applications

Journal of Information Science and Engineering

Volumn 13, Issue 4, 1997, Pages 649-663

  Wang, Chi Su ^a   Chang, Ruay Shiung ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

All pair Shortest Path Problem; Interval Graphs; Maximal Cliques; Parallel Algorithms

Indexed keywords

OPTIMIZATION; PARALLEL ALGORITHMS; POLYNOMIALS; PROGRAM PROCESSORS; SET THEORY;

INTERVAL GRAPHS;

GRAPH THEORY;

EID: 0031382003     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. S.G. Akl, The Design and Analysis of Parallel Algorithms, Prentice-Hall, 1989.
2. M.G. Andrews, M.J. Atallah, D.Z. Chen and D.T. Lee, "Parallel algorithms for maximum matching in interval graphs," Proc. 9th International Parallel Processing Symposium, 1995, pp. 84-92.
3. V.B. Balayogan and C. Pandu Rangan, "Parallel algorithms on interval graphs," Informatique Theorique et Applications, Vol. 29, 1995, pp. 451-470.
4. A. Bertossi, "On the domatic number of interval graphs," Information Processing Letters 28 (1988), pp. 275-280.
5. D.Z. Chen and D.T. Lee, "Solving the all-pair shortest path problem on interval and circular-arc graphs," Proc. 8th International Parallel Processing Symposium, 1994, pp. 224-228.
6. R. Cole, "Parallel merge sort," SIAM Journal on Computing 17(1988) pp. 770-850.
7. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, 1990.
8. S.K. Das and C.C.Y. Chen, "Efficient parallel algorithms on interval graphs," Proc. 4th International PARLE Conference, 1992, pp. 131-143.
9. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
10. J. Ja'Ja, An Introduction to Parallel Algorithms, Addison-Wesley, 1992.
11. D.S. Joshi, R. Scridhar and N. Chandrasekharan, "Efficient algorithms for all-pairs shortest path problem on interval, directed path, and circular-arc graphs," Proc. 5th International Conference on Computing and Information, 1993, pp. 31-35.
12. J.M. Keil, Finding hamiltonian circuits in interval graphs. Information Processing Letters 20(1985), pp. 201-206.
13. R. Mahesh, C. Pandu Rangan and A. Srinivasan, "On finding the minimum bandwidth of interval graphs," Information and Computation 95(1991), pp. 218-224.
14. G.K. Manacher, T.A. Mankus and C.J. Smith, "An optimum Θ(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals," Information Processing Letters 35(1990), pp. 205-211.
15. M.V. Marathe, R. Ravi and C. Pandu Rangan, An optimal algorithm to solve the all-pair shortest path problem on interval graphs, Networks 22(1992), pp. 21-35.
16. K. Menger, Zur Allgemeinen Kurventheorie, Fund. Math., 10(1927), pp. 95-115.
17. C.U. Mertel and D. Gusfield, "A fast parallel quicksort algorithm," Information Processing Letters 30(1989), pp. 97-102.
18. 2) algorithm for the all-pairs shortest path problem on an interval graph." Networks, Vol. 27, 1996, pp. 215-217.
19. J.J. Modi, Parallel Algorithms and Matrix Computation, Clarendon Press, Oxford, 1988.
20. S. Olariu, "A simple linear-time algorithm for computing the center of an interval graph." International J. Computer Math. 34(1990), pp. 121-128.
21. S. Olariu, "An optimal greedy heuristic to color interval graphs." Information Processing Letters 37(1991), pp. 21-25.
22. S. Olariu, J.L. Schwing and J. Zhang, "Optimal parallel algorithms for problems modeled by a family of intervals," IEEE Trans, on Parallel and Distributive Systems 3(1992), pp. 364-74.
23. A.S. Rao and C. Pandu Rangan, "Linear algorithm for domatic number problem on interval graphs," Information Processing Letters 33(1989/90), pp. 29-33.
24. S. Saxena and N.M. Rao, "Parallel algorithms for connectivity problems on interval graphs," Information Processing Letters 56(1995), pp. 37-44.
25. H. Shen, "A fast parallel algorithm for integer sorting," Parallel Computing 89, Proceedings of the International Conference pp. 331-336.
26. A.P. Sprague and K.H. Kulkarni, "Optimal parallel algorithms for finding cut vertices and bridges of interval graphs," Information Processing Letters 42(1992), 229-234.
27. A.P. Sprague, "An O(n log n) algorithm for bandwidth of interval graphs," SIAM J. Discrete Math., Vol. 7, No. 2, 1994, pp. 213-220.
28. R. Sridhar and N. Chasndrasekharan, "Highly parallelizable problems on sorted intervals," Parallel Computing, Vol. 21, No. 3, 1995, pp. 433-446.
29. Y.L. Wang, K.C. Chiang and M.S. Yu, "Optimal algorithms for interval graphs," Proc. 1994 International Computer Symposium, 1994, pp. 19-24.