Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 
sqrt(m/log n))

Alt, Helmut; Blum, Norbert; Mehlhorn, Kurt; Paul, Markus

doi:10.1016/0020-0190(91)90195-N

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 sqrt(m/log n))

MPS-Authors

Alt, Helmut
Max Planck Society;

Blum, Norbert
Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45174

Paul, Markus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Alt, H., Blum, N., Mehlhorn, K., & Paul, M. (1991). Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 sqrt(m/log n)). Information Processing Letters, 37(4), 237-240. doi:10.1016/0020-0190(91)90195-N.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AE27-C

Abstract

There is no abstract available