A min-max relation in flowgraphs

DOI10.1016/J.ENDM.2015.07.019zbMATH Open1347.05086OpenAlexW2200346584MaRDI QIDQ324741FDOQ324741

Authors: Carlos E. Ferreira, Álvaro J. P. Franco 

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.019

Recommendations

• A \(\min\)-\(\max\) relation in flowgraphs and some applications
• scientific article; zbMATH DE number 1751596
• A Minimax Arc Theorem for Reducible Flow Graphs
• Minmax relations for cyclically ordered digraphs
• Minimum flow variation in maximum flows
• Min-max and max-min graph saturation parameters
• scientific article
• scientific article; zbMATH DE number 4064732
• Approximate min-max relations on plane graphs

zbMATH Keywords

junctionsdominatorsflowgraphsvertex-disjoint dipaths

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Flows in graphs (05C21)

Cites Work

• A fast algorithm for finding dominators in a flowgraph
• A Minimax Arc Theorem for Reducible Flow Graphs
• Title not available (Why is that?)
• Algorithms for Junctions in Acyclic Digraphs

Cited In (1)

• A \(\min\)-\(\max\) relation in flowgraphs and some applications

This page was built for publication: A min-max relation in flowgraphs

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