10 citations · 10 across the 4 of their papers we have counts for
4 papers
A Weight-scaling Algorithm for -factors of Multigraphs
Harold Gabow
We discuss combinatorial algorithms for finding a maximum weight -factor on an arbitrary multigraph, for given integral weights of magnitude at most . For simple bipartite gr…
The Weighted Matching Approach to Maximum Cardinality Matching
Harold N. Gabow
Several papers have achieved time for cardinality matching, starting from first principles. This results in a long derivation. We simplify the task by employing well…
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors
Harold N. Gabow, Piotr Sankowski
Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}…
A Model for Minimizing Active Processor Time
Jessica Chang, Harold N. Gabow, Samir Khuller
We introduce the following elementary scheduling problem. We are given a collection of n jobs, where each job has an integer length as well as a set Ti of time intervals in which i…