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 (Q4808429)
From MaRDI portal
scientific article; zbMATH DE number 1915357
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
scientific article; zbMATH DE number 1915357 |
Statements
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 (English)
0 references
22 May 2003
0 references
cardinality matching problem
0 references
network flows
0 references
skew-symmetric graphs
0 references
antisymmetrical digraphs
0 references
graph compression
0 references
clique partition
0 references
