Pages that link to "Item:Q1105385"
From MaRDI portal
The following pages link to The general maximum matching algorithm of Micali and Vazirani (Q1105385):
Displaying 11 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- Affine-invariant strictly cyclic Steiner quadruple systems (Q517265) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- Mining posets from linear orders. (Q2874042) (← links)
- (Q4580154) (← links)
- (Q4731220) (← links)