Parallel approximation algorithms for maximum weighted matching in general graphs

Information Processing Letters

Volumn 76, Issue 1-2, 2000, Pages 13-17

  Uehara, Ryuhei ^a   Chen, Zhi Zhong ^b  

^a KOMAZAWA UNIVERSITY   (Japan)

^b TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PARALLEL ALGORITHMS; PROBLEM SOLVING;

EDGE-WEIGHTED GRAPHS; PARALLEL APPROXIMATION ALGORITHMS;

PATTERN MATCHING;

EID: 0034325652     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00128-9     Document Type: Article

References (14)

1. Avis D. A survey of heuristics for the weighted matching problem. Networks. Vol. 13:1983;475-493.
2. Edmonds J. Paths, trees and flowers. Canad. J. Math. Vol. 17:1965;449-467.
3. Fischer T., Goldberg A.V., Haglin D.J., Plotkin S. Approximating matchings in parallel. Inform. Process. Lett. Vol. 46:1993;115-118.
4. Gabow H.N. Data structures for weighted matching and nearest common ancestors with linking. Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms. 1990;434-443.
5. Galil Z. Efficient algorithms for finding maximum matching in graphs. Comput. Surveys. Vol. 18:(1):1986;23-38.
6. Greenlaw R., Hoover H.J., Ruzzo W.L. Limits to Parallel Computation. 1995;Oxford University Press.
7. Israeli A., Shiloach Y. An improved parallel algorithm for maximal matching. Inform. Process. Lett. Vol. 22:1986;57-60.
8. Johnson D.S. A catalog of complexity classes. van Leeuwen J. The Handbook of Theoretical Computer Science, Vol. I: Algorithms and Complexity. 1990;69-161 Elsevier, Amsterdam.
9. Karp R.M., Ramachandran V. Parallel algorithms for shared-memory machines. van Leeuwen J. The Handbook of Theoretical Computer Science, Vol. I: Algorithms and Complexity. 1990;870-941 Elsevier, Amsterdam.
10. Karp R.M., Upfal E., Wigderson A. Constructing a perfect matching is in random NC. Combinatorica. Vol. 6:(1):1986;35-48.
11. Karpinski M., Rytter W. Fast Parallel Algorithms for Graph Matching Problems. 1998;Clarendon Press, Oxford.
12. Mayr E.W., Subramanian A. The complexity of circuit value and network stability. J. of Comput. System Sci. Vol. 44:1992;302-323.
13. Preis R. Linear time 1 2 -approximation algorithm for maximum weighted matching in general graphs. STACS '99. Lecture Notes in Comput. Sci. Vol. 1563:1999;259-269 Springer, Berlin.
14. Venkatesan S.M. Approximation algorithms for weighted matching. Theoret. Comput. Sci. Vol. 54:1987;129-137.