A Minimax Arc Theorem for Reducible Flow Graphs

DOI10.1137/0403048zbMath0712.68046OpenAlexW2956076259MaRDI QIDQ3197325

Vijaya Ramachandran

Publication date: 1990

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0403048

zbMATH Keywords

graph theoryminimax theoremnetwork flowflow graph

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

A min-max relation in flowgraphs, Packing feedback arc sets in reducible flow graphs, Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers, Solving problems for maximal reducible flowgraphs., A \(\min\)-\(\max\) relation in flowgraphs and some applications