Cited By
View all- Cygan MGabow HSankowski P(2015)Algorithmic Applications of Baur-Strassen’s TheoremJournal of the ACM10.1145/273628362:4(1-30)Online publication date: 11-Sep-2015
A combinatoric interpretation of dual variables for weighted matching and f-factors
Abstract
The linear program dual variables for weighted matching and its generalization to f-factors are shown to be the weights of certain subgraphs: y duals are the weights of certain maximum matchings or f-factors; z duals are the weights of certain 2-factors or 2f-factors. Similar interpretations have been given for the bipartite case of these problems, where only y duals occur, but our variant is included here for completeness. In all cases the y duals are canonical in a well-defined sense; z duals are canonical for matching and more generally for b-matchings (a special case of f-factors) but for f-factors their support can vary. As weights of combinatoric objects the duals are integral for given integral edge weights, and so they give new proofs that the linear programs for these problems are TDI.
References
[1]
N. Blum, A simplified realization of the Hopcroft-Karp approach to maximum matching in general graphs, Tech. Rept. 85232-CS, Computer Science Department, University of Bonn, 2001.
[2]
M. Cygan, H.N. Gabow, P. Sankowski, Algorithmic applications of Baur-Strassen***s theorem: shortest cycles, diameter and matchings, CoRR abstract 1204.1616, in: Proc. 53rd Annual IEEE Symp. on Foundations of Comp. Sci., 2012 (in press).
[3]
M. Cygan, H.N. Gabow, P. Sankowski, Algebraic algorithms for b-matching and f-factors (in preparation).
[4]
Cunningham, W.H. and Marsh III, A.B., A primal algorithm for optimum matching. In: Balinski, M.L., Hoffman, A.J. (Eds.), Math. Programming Study, vol. 8. North-Holland, Amsterdam. pp. 50-72.
[5]
Derigs, U., Solving non-bipartite matching problems via shortest path techniques. Ann. Oper. Res. v13. 225-261.
[6]
Edmonds, J., Paths, trees, and flowers. Canad. J.~Math. v17. 449-467.
[7]
Edmonds, J., Maximum matching and a polyhedron with 0,1-vertices. J.~Res.~Nat.~Bur.~Standards. v69B. 125-130.
[8]
N.J.A. Harvey, An algebraic algorithm for weighted linear matroid intersection, in: Proc. 18th Annual ACM-SIAM Symp. on Discrete Algorithms, 2007, pp. 444***453.
[9]
Iri, M., A new method for solving transportation-network problems. J.~Oper. Res.~Soc. Japan. v3. 27-87.
[10]
Karp, R.M., Upfal, E. and Wigderson, A., Constructing a perfect matching is in Random NC. Combinatorica. v6 i1. 35-48.
[11]
Lawler, E.L., Combinatorial Optimization: Networks and Matroids. 1976. Holt, Rinehart, and Winston, NY.
[12]
Lov´sz, L., A note on factor-critical graphs. Studia Sci. Math. Hungar. v7. 279-280.
[13]
Lov´sz, L., On determinants, matchings, and random algorithms. In: Budach, L. (Ed.), Fundamentals of Computation Theory, Akademie Verlag, Berlin. pp. 565-574.
[14]
Lov´sz, L. and Plummer, M.D., . In: North-Holland Mathematics Studies, vol. 121. North-Holland, NY.
[15]
S. Micali, V.V. Vazirani, An O(***V******E***) algorithm for finding maximum matching in general graphs, in: Proc. 21st Annual IEEE Symp. on Foundations of Comp. Sci., 1980, pp. 17***27.
[16]
Mulmuley, K., Vazirani, U.V. and Vazirani, V.V., Matching is as easy as matrix inversion. Combinatorica. v7 i1. 105-113.
[17]
Sankowski, P., Maximum weight bipartite matching in matrix multiplication time. Theoret. Comput.~Sci. v410 i44. 4480-4488.
[18]
Schrijver, A., Combinatorial Optimization: Polyhedra and Efficiency. 2003. Springer, NY.
[19]
Vazirani, V.V., A theory of alternating paths and blossoms for proving correctness of the O(VE) general graph matching algorithm. Combinatorica. v14. 71-109.
Index Terms
- A combinatoric interpretation of dual variables for weighted matching and f-factors
Index terms have been assigned to the content through auto-classification.
Recommendations
Data Structures for Weighted Matching and Extensions to b-matching and f-factors
Special Issue on SODA’16 and Regular PapersThis article shows the weighted matching problem on general graphs can be solved in time O(n(m + n log n)) for n and m the number of vertices and edges, respectively. This was previously known only for bipartite graphs. The crux is a data structure for ...
Equimatchable Graphs on Surfaces
A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...
Factors and vertex-deleted subgraphs
A relationship is considered between an f-factor of a graph and that of its vertex-deleted subgraphs. Katerinis [Some results on the existence of 2n-factors in terms of vertex-deleted subgraphs, Ars Combin. 16 (1983) 271-277] proved that for even ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V. © 2012.
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Published: 01 October 2012
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
Cited By
View all- Cygan MGabow HSankowski P(2015)Algorithmic Applications of Baur-Strassen’s TheoremJournal of the ACM10.1145/273628362:4(1-30)Online publication date: 11-Sep-2015
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in