Integral biflow maximization

DOI10.1016/J.JCTB.2025.12.006MaRDI QIDQ6844073zbMATH OpenFDO

Authors Guoli Ding, Rongchuan Tao, Mengxi Yang, Wenan Zang

Publication date 16 March 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

algorithmcharacterizationstructurebicutbiflow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Flows in graphs (05C21)

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 49899 (Why is no real title available?)
• scientific article; zbMATH DE number 53949 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• A Faster Deterministic Maximum Flow Algorithm
• A fast algorithm for maximum integral two-commodity flow in planar graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Depth-First Search and Linear Graph Algorithms
• Dividing a Graph into Triconnected Components
• Efficient Planarity Testing
• Excluding a large theta graph
• Improved algorithms for graph four-connectivity
• Max flows in \(O(nm)\) time, or better
• Multi-Commodity Network Flows
• On Two Commodity Network Flows
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the planar integer two-flow problem
• The matroids with the max-flow min-cut property
• Two commodity flows
• Two commodity network flows and linear programming
• Two-Commodity Flow

This page was built for publication: Integral biflow maximization

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