Performance of matching algorithms in practice

From: Daniel Marx (dmarx_at_cs.bme.hu.nospam)
Date: 10/03/04 

Date: Sun, 03 Oct 2004 08:47:00 GMT

Hi,

Do you have a reference on how efficient are the matching algorithms
in practice? I'm looking for a statement "Nowadays, with a decent
computer we can find a maximum matching in a 10000 vertex bipartite
graph in a few minutes," or something like that.

I have the same question also with network flows.

Thanks,
Daniel Marx