Back to search
An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
Data up to Jan 2025
Published1986
Citations130
References6
Total Citations Per Year
Abstract
References (6)
The Design and Analysis of Computer Algorithms
1974 • 9,688 citations
Combinatorial optimization: networks and matroids
2021 • 3,410 citations
Paths, Trees, and Flowers
1965 • 2,165 citations
Maximum matching and a polyhedron with 0,1-vertices
1965 • 1,719 citations
Finding optimum branchings
1977 • 376 citations
An O(EVIog2V) algorithm for the maximal flow problem
1980 • 63 citations
Cited By (0)
Loading...