An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

Authors:
Taenam Kim;Kyung-Yong Chwa
Affiliations:
Korea Advanced Inst. of Science and Technology, Seoul, Korea;Korea Advanced Inst. of Science and Technology, Seoul, Korea
Venue:
Information Processing Letters
Year:
1987

Citing 0
Cited 5

Almost-optimum speed-ups of algorithms for bipartite matching and related problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
An adjustable linear time parallel algorithm for maximum weight bipartite matching

Information Processing Letters
An adjustable linear time parallel algorithm for maximum weight bipartite matching

Information Processing Letters
Finding maximum matching for bipartite graphs in parallel

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract