Randomized Õ(M(|V|)) algorithms for problems in matching theory

SIAM Journal on Computing

Volumn 26, Issue 6, 1997, Pages 1635-1655

  Cheriyan, Joseph ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Allowed edges; Bipartite minimum vertex covers; Canonical partition; Digraph minimum vertex separators; Gallai Edmonds decomposition; Matching theory; Randomized algorithms

Indexed keywords

EID: 0346084499     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793256223     Document Type: Article

References (34)

1. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. N. BLUM, A new approach to maximum matching in general graphs, Proc. 17th ICALP, Lecture Notes in Comput. Sci. 443, Springer-Verlag, Berlin, 1990, pp. 586-597.
3. R. A. BRUALDI AND H. J. RYSER, Combinatorial Matrix Theory, Cambridge University Press, New York, 1991.
4. J. CHERIYAN, Random weighted Laplacians, Lovász minimum digraphs and finding minimum separators, extended abstract in Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, SIAM, Philadelphia, 1993, pp. 31-40.
5. 2.38) algorithm for the cardinality of a maximum matching, extended abstract in Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, SIAM, Philadelphia, 1994, pp. 442-451.
6. J. CHERIYAN AND J. H. REIF, Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity, Combinatorica, 14 (1994), pp. 435-451.
7. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
8. W. EBERLY, Efficient parallel independent subsets and matrix factorizations, in Proc. 3rd IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 204-211.
9. J. EDMONDS, Paths, trees and flowers, Canad. J. Math., 17 (1965), pp. 449-467.
10. H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for general graph-matching problems, J. Assoc. Comput. Mach., 38 (1991), pp. 815-853.
11. Z. GALIL AND V. PAN, Improved processor bounds for combinatorial problems in RNC, Combinatorica, 8 (1988), pp. 189-200.
12. T. GALLAI, Maximale Systeme unabhängiger Kanten, Magyar Tud. Akad. Mat. Kutató Int. Közl, 9 (1964), pp. 401-413.
13. M. RAUCH HENZINGER AND V. KING, Randomized dynamic algorithms with polylogarithmic time per operation, in Proc. 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV, ACM, New York, 1995, pp. 519-527.
14. O. H. IBARRA, S. MORAN, AND R. HUI, A generalization of the fast LUP matrix decomposition algorithm and applications, J. Algorithms, 3 (1982), pp. 45-56.
15. A. W. INGLETON AND M. J. PIFF, Gammoids and transversal matroids, J. Combin. Theory Ser. B, 15 (1973), pp. 51-68.
16. E. KALTOFEN AND V. PAN, Processor efficient parallel solution of linear systems over an abstract field, in Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1991, pp. 180-191.
17. H. J. KARLOFF, A Las Vegas RNC algorithm for maximum matching, Combinatorica, 6 (1986), pp. 387-391.
18. R. M. KARP, E. UPFAL, AND A. WIGDERSON, Constructing a perfect matching is in Random NC, Combinatorica, 6 (1986), pp. 35-48.
19. D. KOZEN, The Design and Analysis of Algorithms, Springer-Verlag, Berlin, 1991.
20. J. A. LA POUTRÉ, Personal communication, 1995.
21. J. A. LA POUTRÉ AND J. WESTBROOK, Dynamic two-connectivity with backtracking, in Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, SIAM, Philadelphia, 1994, pp. 204-212.
22. N. LINIAL, L. LOVÁSZ, AND A. WIGDERSON, Rubber bands, convex embeddings and graph connectivity, Combinatorica, 8 (1988), pp. 91-102.
23. L. LOVÁSZ, On determinants, matchings and random algorithms, in Fundamentals of Computation Theory, L. Budach, ed., Akademie-Verlag, Berlin, 1979, pp. 565-574.
24. L. LOVÁSZ, Combinatorial Problems and Exercises, 2nd ed., North-Holland, Amsterdam, 1993.
25. L. LOVÁSZ AND M. PLUMMER, Matching Theory, Akadémiai Kiadó, Budapest, Hungary, 1986.
26. S. MICALI AND V. V. VAZIRANI, An O(√|V||E|) algorithm for finding maximum matching in general graphs, in Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, NY, IEEE Computer Society Press, Los Alamitos, CA, 1980, pp. 17-27.
27. K. MULMULEY, U. V. VAZIRANI, AND V. V. VAZIRANI, Matching is as easy as matrix inversion, Combinatorica, 7 (1987), pp. 105-113.
28. M. O. RABIN AND V. V. VAZIRANI, Maximum matchings in general graphs through randomization, J. Algorithms, 10 (1989), pp. 557-567.
29. J. T. SCHWARTZ, Fast probabilistic algorithms for verification of polynomial identities, J. ACM, 27 (1980), pp. 701-717.
30. D. D. SLEATOR AND R. E. TARJAN, A data structure for dynamic trees, J. Comput. System Sci., 26 (1983), pp. 362-391.
31. W. T. TUTTE, The factorization of linear graphs, J. London Math. Soc., 22 (1947), pp. 107-111.
32. V. V. VAZIRANI, A theory of alternating paths and blossoms for proving correctness of the O(√VE) general graph matching algorithm, Combinatorica, 14 (1994), pp. 71-109.
33. J. WEIN, Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems, Inform. Process. Lett., 40 (1991), pp. 161-167.
34. R. E. ZIPPEL, Probabilistic algorithms for sparse polynomials, in Proc. EUROSAM 79, Edward W. Ng, ed., Lecture Notes in Comput. Sci. 72, Springer-Verlag, Berlin, 1979, pp. 216-226.