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

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

Work

Year: 2003

Type: article

Source: Networks

Authors Christian Fremuth‐Paeger, Dieter Jungnickel

Institution University of Augsburg

Cites: 9

Cited by: 15

Related to: 10

FWCI: 0.34

Citation percentile (by year/subfield): 67.46

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed