Balanced network flows. IV: Duality and structure theory.

DOI10.1002/NET.1013zbMATH Open1038.90007OpenAlexW1970533659MaRDI QIDQ2744653FDOQ2744653

Christian Fremuth-Paeger, Dieter Jungnickel

Publication date: 31 July 2002

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

network flowsdualitybarrierscutsodd setsfactor theoremscapacitated matching problemsGallai - Edmonds decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10)

Cites Work

• The Factors of Graphs
• Subgraphs with prescribed valencies
• Antisymmetrical Digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balanced network flows. III. Strongly polynomial augmentation algorithms

Cited In (8)

• Balanced network flows. III. Strongly polynomial augmentation algorithms
• Balanced network flows. VI: Polyhedral descriptions.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balanced network flows. VII: Primal-dual algorithms.
• Title not available (Why is that?)
• Graph factors and factorization: 1985--2003: a survey
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Decomposition of bipartite graphs under degree constraints 👍 👎
• Title not available (Why is that?) 👍 👎
• Balanced graphs and network flows 👍 👎
• Balanced network flows. V: Cycle-canceling algorithms. 👍 👎

This page was built for publication: Balanced network flows. IV: Duality and structure theory.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744653)