Parallel algorithms for maximum matching in complements of interval graphs and related problems

Algorithmica (New York)

Volumn 26, Issue 2, 2000, Pages 263-289

  Andrews, M G ^a   Atallah, M J ^b   Chen, D Z ^c   Lee, D T ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b Purdue University   (United States)

^c University of Notre Dame   (United States)

^d INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Complement graphs; EREW PRAM; Hypercubes; Interval graphs; Maximum matching problems; Parallel algorithms

Indexed keywords

EID: 0346233617     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910013     Document Type: Article

References (27)

1. R. Anderson and O. L. Miller, Deterministic Parallel List Ranking, Algorithmica, 6 (1991), 859-868.
2. M. G. Andrews, Efficient Parallel Graph Algorithms on the Hypercube Network Model, Ph. D. Thesis, Northwestern University, December 1992.
3. M. G. Andrews and D. T. Lee, An Optimal Algorithm for Matching in Interval Graphs, manuscript (1992).
4. M. J. Atallah, M. T. Goodrich, and S. R. Kosaraju, On the Parallel Complexity of Evaluating Some Sequences of Set Manipulation Operations, J. Assoc. Comput. Mach., 41 (1994), 1049-1088.
5. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin, Highly Parallelizable Problems, Proc. 21st Annual ACM Symp. on Theory of Computing, 1989, pp. 309-319.
6. G. Bilardi and A. Nicolau, Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines, SIAM J. Comput., 18 (1989), 216-228.
7. R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions, J. Assoc. Comput. Mach., 21 (2) (1974), 201-206.
8. D. Z. Chen, Efficient Parallel Binary Search on Sorted Arrays, with Applications, IEEE Trans. Parallel Distrib. Systems, 6(4) (1995), 440-445.
9. D. Z. Chen, Optimal Hypercube Algorithms for Triangulating Classes of Polygons and Related Problems, Proc. 7th Internat. Conf. on Parallel and Distributed Computing Systems, Las Vegas, NV, 1994, pp. 174-179.
10. R. Cole, Parallel Merge Sort, SIAM J. Computing, 17 (1988), 770-785.
11. R. Cole and U. Vishkin, Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking, Inform. and Control, 70 (1986), 32-53.
12. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1990.
13. R. Cypher and C. G. Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers, J. Comput. System Sci., 47 (1993), 501-548.
14. E. Dekel and S. Sahni, A Parallel Matching Algorithm for Convex Bipartite Graphs, Proc. International Conf. on Parallel Processing, 1982, pp. 178-184.
15. H. N. Gabow and R. E. Tarjan, A Linear-Time Algorithm for a Special Case of Disjoint Set Union, J. Comput. System Sci., 30 (1985), 209-221.
16. G. Gallo, An O(n log n) Algorithm for the Convex Bipartite Matching Problem, Oper. Res. Lett, 3(1) (1984), 31-34.
17. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
18. T. Hagerup and C. Rub, Optimal Merging and Sorting on the EREW PRAM, Inform. Process. Lett., 33 (1989), 181-185.
19. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
20. S. K. Kim, Optimal Parallel Algorithms on Sorted Intervals, Proc. 27th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, IL, 1989, pp. 766-775.
21. D. Kravets and C. G. Plaxton, Optimal Hypercube Algorithm for the All-Nearest Smaller Values Problem, Proc. 6th IEEE Symp. on Parallel and Distributed Processing, Dallas, TX, 1994.
22. C. P. Kruskal, L. Rudolph, and M. Snir, The Power of Parallel Prefix, IEEE Trans. Comput., 34(10) (1985), 965-968.
23. R. E. Ladner and M. J. Fischer, Parallel Prefix Computation, J. Assoc. Comput. Mach., 27 (1980), 831-838.
24. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
25. W. Lipski, Jr., and F. P. Preparata, Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems, Acta Inform., 15 (1981), 329-346.
26. A. Moitra and R. C. Johnson, A Parallel Algorithm for Maximum Matching in Interval Graphs, Proc. Int. Conf. on Parallel Processing, 1989, Vol. III, pp. 114-120.
27. R. E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.