Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n2/m)/log n) bound for the nonbipartite cardinality matching problem

From MaRDI portal
Publication:4808429