A theory of alternating paths and blossoms from the perspective of minimum length
Year of publication: |
2024
|
---|---|
Authors: | Vazirani, Vijay V. |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 3, p. 2009-2047
|
Subject: | alternating paths | augmenting paths | blossoms | double depth first search | efficient algorithms | maximum matching problem |
-
A normalized basis for C1 cubic super spline space on Powell–Sabin triangulation
Lamnii, M., (2014)
-
Recovery of disrupted airline operations using k-maximum matching in graphs
Nisse, Nicolas, (2023)
-
On the communication complexity of approximate Nash equilibria
Goldberg, Paul W., (2014)
- More ...
-
Strategyproof cost-sharing mechanisms for set cover and facility location games
Devanur, Nikhil R., (2005)
-
Eisenberg-Gale markets: Algorithms and game-theoretic properties
Jain, Kamal, (2010)
-
A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It
Goel, Gagan, (2011)
- More ...