Maximum skew-symmetric flows and matchings

  • Authors:

  • Andrew V. Goldberg;Alexander V. Karzanov

  • Affiliations:

  • Microsoft Research, 1065 La Avenida SVC/5, Mountain View, CA 94043, USA Part of this research was done while this author was at NEC Research Institute, Inc., Princeton, NJ.;Institute for System Analysis of the Russian Academy of Sciences, 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia This author was supported in part by a grant from the Russian Foundation of B ...

  • Venue:
  • Mathematical Programming: Series A and B
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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 * 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 * 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.