- Harold N. Gabow. An
efficient implementation of Edmonds' algorithm for maximum matching on
graphs. Journal of the ACM, 23(2):221-234, April 1976.
Citations.
- Frank Fussenegger and Harold N. Gabow. A counting approach to lower
bounds for selection problems. Journal of the ACM,
26(2):227-238, April 1979.
Citations.
- Harold N. Gabow. An
almost-linear algorithm for two-processor scheduling. Journal
of the ACM, 29(3):766-780, July 1982.
Citations.
- Harold N. Gabow, Zvi Galil, and Thomas H. Spencer. Efficient implementation of graph
algorithms using contraction. Journal of the ACM,
36(3):540-572, July 1989.
Citations.
- Harold N. Gabow and Robert E. Tarjan. Faster scaling algorithms for
general graph-matching problems. Journal of the ACM,
38(4):815-853, October 1991.
References,
Citations,
etc.
Shortcuts: