Advertisement

Mathematical Programming

, Volume 100, Issue 3, pp 537–568 | Cite as

Maximum skew-symmetric flows and matchings

  • Andrew V. Goldberg
  • Alexander V. KarzanovEmail author
Article
First Online:

Abstract.

The maximum integer skew-symmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of self-conjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical results on usual network flows, such as the flow decomposition, augmenting path, and max-flow min-cut theorems. We give unified and shorter proofs for those theoretical results. We then extend to MSFP the shortest augmenting path method of Edmonds and Karp [7] and the blocking flow method of Dinits [4], obtaining algorithms with similar time bounds in general case. Moreover, in the cases of unit arc capacities and unit “node capacities” our blocking skew-symmetric flow algorithm has time bounds similar to those established in [8, 21] for Dinits’ algorithm. In particular, this implies an algorithm for finding a maximum matching in a nonbipartite graph in Open image in new window time, which matches the time bound for the algorithm of Micali and Vazirani [25]. Finally, extending a clique compression technique of Feder and Motwani [9] to particular skew-symmetric graphs, we speed up the implied maximum matching algorithm to run in Open image in new window time, improving the best known bound for dense nonbipartite graphs. Also other theoretical and algorithmic results on skew-symmetric flows and their applications are presented.

Keywords

skew-symmetric graph network flow - matching b-matching 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anstee, R.P.: An algorithmic proof of Tuttes’ f-factor theorem. J. of Algorithms 6, 112–131 (1985)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Anstee, R.P.: A polynomial algorithm for b-matchings: An alternative approach. Information Proc. Letters 24, 153–157 (1987)CrossRefMathSciNetzbMATHGoogle Scholar
  3. 3.
    Blum, N.: A new approach to maximum matching in general graphs. In Automata, Languages and Programming [Lecture Notes in Comput. Sci. 443] (Springer, Berlin, 1990), pp. 586–597Google Scholar
  4. 4.
    Dinic, E. A.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. 11, 1277–1280 (1970)Google Scholar
  5. 5.
    Edmonds, J.: Paths, trees and flowers. Canadian J. Math. 17, 449–467 (1965)zbMATHGoogle Scholar
  6. 6.
    Edmonds, J., Johnson, E. L.: Matching: a well-solved class of integer linear programs. In R. Guy, H. Haneni, and J. Schönheim, eds, Combinatorial Structures and Their Applications, Gordon and Breach, NY, 1970, pp. 89–92Google Scholar
  7. 7.
    Edmonds, J., Karp, R. M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19, 248–264 (1972)CrossRefzbMATHGoogle Scholar
  8. 8.
    Even, S., Tarjan, R. E.: Network flow and testing graph connectivity. SIAM J. Comput. 4, 507–518 (1975)zbMATHGoogle Scholar
  9. 9.
    Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. In Proc. 23rd Annual ACM Symp. on Theory of Computing, 1991, pp. 123–133Google Scholar
  10. 10.
    Ford, L. R., Fulkerson, D. R.: Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962Google Scholar
  11. 11.
    Fremuth-Paeger, C., Jungnickel, D.: Balanced network flows. Parts I–III. Networks 33, 1–56 (1999)zbMATHGoogle Scholar
  12. 12.
    Gabow, H. N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. Proc. of STOC 15, 448–456 (1983)Google Scholar
  13. 13.
    Gabow, H. N., Tarjan, R. E.: A linear-time algorithm for a special case of disjoint set union. J. Comp. and Syst. Sci. 30, 209–221 (1985)CrossRefMathSciNetzbMATHGoogle Scholar
  14. 14.
    Gabow, H. N., Tarjan, R. E.: Faster scaling algorithms for general graph-matching problems. J. ACM 38, 815–853 (1991)CrossRefzbMATHGoogle Scholar
  15. 15.
    Goldberg, A. V., Karzanov, A. V.: Maximum skew-symmetric flows. In P. Spirakis, ed., Algorithms – ESA ‘95 (Proc. 3rd European Symp. on Algorithms). Lecture Notes in Computer Sci. 979, 155–170 (1995)Google Scholar
  16. 16.
    Goldberg, A. V., Karzanov, A. V.: Path problems in skew-symmetric graphs. Combinatorica 16, 129–174 (1996)Google Scholar
  17. 17.
    Goldberg, A. V., Karzanov, A. V.: Maximum skew-symmetric flows and their applications to b-matchings. Preprint 99-043, SFB 343, Bielefeld Universität, Bielefeld, April 1999, 25 ppGoogle Scholar
  18. 18.
    Hopcroft, J. E., Karp, R. M.: An n5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2, 225–231 (1973)zbMATHGoogle Scholar
  19. 19.
    Karzanov, A. V.: Èkonomnyi algoritm nakhozhdeniya bikomponent grafa [Russian; An efficient algorithm for finding the bicomponents of a graph]. In Trudy Tret’ei Zimnei Shkoly po Matematicheskomu Programmirovaniyu i Smezhnym Voprosam [Proc. of 3rd Winter School on Mathematical Programming and Related Topics], issue 2. Moscow Engineering and Construction Inst. Press, Moscow, 1970, pp. 343–347Google Scholar
  20. 20.
    Karzanov, A.V.: Tochnaya otsenka algoritma nakhozhdeniya maksimal’nogo potoka, primenennogo k zadache ‘‘o predstavitelyakh’’ [Russian; An exact estimate of an algorithm for finding a maximum flow, applied to the problem ‘‘of representatives’’]. In Voprosy Kibernetiki [Problems of Cybernetics], volume~3. Sovetskoe Radio, Moscow, 1973, pp. 66–70Google Scholar
  21. 21.
    Karzanov, A.V.: O nakhozhdenii maksimal’nogo potoka v setyakh spetsial’nogo vida i nekotorykh prilozheniyakh [Russian; On finding maximum flows in networks with special structure and some applications]. In Matematicheskie Voprosy Upravleniya Proizvodstvom [Mathematical Problems for Production Control], volume~5. Moscow State University Press, Moscow, 1973, pp. 81–94Google Scholar
  22. 22.
    Kocay, W., Stone, D.: Balanced network flows. Bulletin of the ICA 7, 17–32 (1993)zbMATHGoogle Scholar
  23. 23.
    Lawler, E. L.: Combinatorial Optimization: Networks and Matroids. Holt, Reinhart, and Winston, New York, NY., 1976Google Scholar
  24. 24.
    Lovász, L., Plummer, M. D.: Matching Theory. Akadémiai Kiadó, Budapest, 1986Google Scholar
  25. 25.
    Micali, S., Vazirani, V.V.: An Open image in new window algorithm for finding maximum matching in general graphs. Proc. of the 21st Annual IEEE Symposium in Foundation of Computer Science, 1980, pp. 71–109Google Scholar
  26. 26.
    Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency, Volume~A. (Algorithms and Combinatorics 24), Springer, Berlin and etc., 2003Google Scholar
  27. 27.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146–160 (1972)zbMATHGoogle Scholar
  28. 28.
    Tutte, W.T.: Antisymmetrical digraphs. Canadian J. Math. 19, 1101–1117 (1967)zbMATHGoogle Scholar
  29. 29.
    Vazirani, V.V.: A theory of alternating paths and blossoms for proving correctness of the Open image in new window general graph maximum matching algorithm. In: R. Kannan and W.R. Cunningham, eds., Integer Programming and Combinatorial Optimization (Proc. 1st IPCO Conference), University of Waterloo Press, Waterloo, Ontario, 1990, pp. 509–535Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  1. 1.Microsoft ResearchUSA Part of this research was done while this author was at NEC Research Institute, Inc., Princeton, NJ.
  2. 2.Institute for System Analysis of the Russian Academy of SciencesMoscowRussia This author was supported in part by a grant from the Russian Foundation of Basic Research.

Personalised recommendations

Cite article

Buy options