A Minimax Arc Theorem for Reducible Flow Graphs

DOI10.1137/0403048MaRDI QIDQ3197325zbMATH OpenOpenAlexFDO

Authors 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

flow graphgraph theoryminimax theoremnetwork flow

Mathematics Subject Classification ID

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

Recommendations

• Finding a minimum feedback arc set in reducible flow graphs
• scientific article; zbMATH DE number 1439470
• A \(\min\)-\(\max\) relation in flowgraphs and some applications
• scientific article; zbMATH DE number 1751596
• Solving problems for maximal reducible flowgraphs
• scientific article; zbMATH DE number 4064732
• Solving problems for maximal reducible flowgraphs.
• Packing feedback arc sets in reducible flow graphs
• Flow hypergraph reducibility
• Flow Hypergraph Reducibility

Cited in

(6)

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

This page was built for publication: A Minimax Arc Theorem for Reducible Flow Graphs

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