Computing a maximum cardinality matching in a bipartite graph in time O(n1.5mlog n)

✍ Scribed by H. Alt; N. Blum; K. Mehlhorn; M. Paul

• Publisher: Elsevier Science
• Year: 1991
• Tongue: English
• Weight: 503 KB
• Volume: 37
• Category: Article
• ISSN: 0020-0190
• DOI: 10.1016/0020-0190(91)90195-n