11 citations · 21 across the 4 of their papers we have counts for
4 papers
Data Structures for Weighted Matching and Extensions to -matching and -factors
Harold N. Gabow
This paper shows the weighted matching problem on general graphs can be solved in time for and the number of vertices and edges, respectively. This was…
A Data Structure for Nearest Common Ancestors with Linking
Harold N. Gabow
Consider a forest that evolves via operations that make the root of one tree the child of a node in another tree. Intermixed with operations are operations, whi…
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…
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
Marek Cygan, Harold N. Gabow, Piotr Sankowski
Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general fram…