H. Gabow

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 2016 · cs.DSShow all

2 papers · 2 filters

cs.DS2016★ 7 cited

Data Structures for Weighted Matching and Extensions to $b$ -matching and $f$ -factors

Harold N. Gabow

This paper shows the weighted matching problem on general graphs can be solved in time $O (n (m + n lo g n))$ for $n$ and $m$ the number of vertices and edges, respectively. This was…

cs.DS2016★ 1 cited

A Data Structure for Nearest Common Ancestors with Linking

Harold N. Gabow

Consider a forest that evolves via $l ink$ operations that make the root of one tree the child of a node in another tree. Intermixed with $l ink$ operations are $n c a$ operations, whi…

Data Structures for Weighted Matching and Extensions to b-matching and f-factors

A Data Structure for Nearest Common Ancestors with Linking

Data Structures for Weighted Matching and Extensions to $b$ -matching and $f$ -factors