Publication:4540086
From MaRDI portal
DOI<1::AID-NET1>3.0.CO;2-M 10.1002/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-MzbMath0999.90005MaRDI QIDQ4540086
Dieter Jungnickel, Christian Fremuth-Paeger
Publication date: 21 July 2002
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Integer equal flows, Graph factors and factorization: 1985--2003: a survey, Balanced network flows. IV. Duality and structure theory, Balanced network flows. VI. Polyhedral descriptions, Balanced network flows. VII. Primal-dual algorithms
Cites Work
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
- Path problems in skew-symmetric graphs
- Balanced network flows. IV. Duality and structure theory
- Balanced network flows. V. Cycle-canceling algorithms
- TWO THEOREMS IN GRAPH THEORY
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- Network Flow and Testing Graph Connectivity
- An algorithmic proof of Tutte's f-factor theorem
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- Antisymmetrical Digraphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- The Factors of Graphs
