Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!asuvax!ncar!mephisto!udel!sbcs!sbwarren!joung
From: joung@sbwarren.cs.sunysb.edu (Joung Yuh-Jzer)
Newsgroups: comp.theory
Subject: The time complexity of Maximum Matching
Message-ID: <1990Sep25.185743.21748@sbcs.sunysb.edu>
Date: 25 Sep 90 18:57:43 GMT
References: <1990Sep17.073031.27131@tss.com>
Sender: usenet@sbcs.sunysb.edu (Usenet poster)
Organization: State University of New York at Stony Brook
Lines: 3

Hi, Does any one know what the time complexity of the fastest known
algorithm for graph matching problem on bipartite graphs 
(i.e. the marriage matching problem) is?