activity
20122021
most citedAlgorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

11 citations · 31 across the 8 of their papers we have counts for

collaborators
Showing 2014 · cs.DSShow all

1 paper · 2 filters

cs.DS2014★ 2 cited

Set-merging for the Matching Algorithm of Micali and Vazirani

Harold N. Gabow

The algorithm of Micali and Vazirani \cite{MV} finds a maximum cardinality matching in time if an efficient set-merging algorithm is used. The latter is provided by…