A min-max relation in flowgraphs

DOI10.1016/j.endm.2015.07.019zbMath1347.05086OpenAlexW2200346584MaRDI QIDQ324741

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

Publication date: 17 October 2016

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

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)

Related Items (1)

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

Cites Work

• A Minimax Arc Theorem for Reducible Flow Graphs
• A fast algorithm for finding dominators in a flowgraph
• Algorithms for Junctions in Acyclic Digraphs
• Unnamed Item

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