Abstract
We introduce the maximum skew-symmetric flow problem which generalizes flow and matching problems. We develop a theory of skew-symmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew-symmetric flow case. In the special case of the skew-symmetric flow problem that corresponds to cardinality matching, our algorithm is simpler and more efficient than the corresponding matching algorithm.
Cite
CITATION STYLE
Goldberg, A. V., & Karzanov, A. V. (1995). Maximum skew-symmetric flows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 979, pp. 155–170). Springer Verlag. https://doi.org/10.1007/3-540-60313-1_141
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
