![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 16 | 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) |
Selection of 1 from 28 records - Norbert Blum has 8 coauthors
Copyright © 2009-12-05 by Michael Ley (ley@uni-trier.de)