Login / Signup

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.

Christian Fremuth-PaegerDieter Jungnickel
Published in: Networks (2003)
Keyphrases
  • worst case
  • network flow
  • preprocessing phase
  • lower bound
  • learning algorithm
  • significant improvement
  • search algorithm
  • error bounds
  • stereo correspondence
  • min cost