A scaling algorithm for weighted matching on general graphs

  • Harold N. Gabow
  • Published 1985 in
    26th Annual Symposium on Foundations of Computer…


This paper presents an algorithm for maximum matching on general graphs with integral edge weights, running in time O(n3/4m lg N), where n, m and N are the number of vertices, number of edges, and largest edge weight magnitude, respectively. The best previous bound is O(n(mlg lg lgd n + n lg n)) where d is the density of the graph. The algorithm finds… (More)
DOI: 10.1109/SFCS.1985.3

1 Figure or Table



Citations per Year

99 Citations

Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics