Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem - researchr publication

researchr

You are not signed in
Sign in
Sign up

Christian Fremuth-Paeger, Dieter Jungnickel. Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem. Networks, 41(3):137-142, 2003. [doi]

Abstract is missing.

runs on WebDSL