𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Christian Fremuth-Paeger; Dieter Jungnickel


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
108 KB
Volume
41
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.