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

DOI10.1002/net.10066zbMath1106.90013OpenAlexW1971063518MaRDI QIDQ4808429

Christian Fremuth-Paeger, Dieter Jungnickel

Publication date: 22 May 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10066

zbMATH Keywords

network flowsclique partitiongraph compressioncardinality matching problemskew-symmetric graphsantisymmetrical digraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

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