Lucchesi–Younger theorem
ID: lucchesi-younger-theorem
The Lucchesi–Younger theorem is a result in the field of combinatorial optimization, particularly related to the study of directed graphs and their networks. The theorem states that for any directed acyclic graph (DAG), there exists a way to assign capacities to the edges of the graph such that the maximum flow from a designated source node to a designated sink node can be achieved by the flow through a certain subset of the edges.
New to topics? Read the docs here!