| |
| 1991 | ||
|---|---|---|
| 1 | Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul: Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. 37(4): 237-240 (1991) | |
| 1 | Helmut Alt | [1] |
| 2 | Norbert Blum | [1] |
| 3 | Kurt Mehlhorn | [1] |