Approximate max-flow min-cut theorem
id:
approximate-max-flow-min-cut-theorem-303-16219895
title:
Approximate max-flow min-cut theorem
text:
Approximate max-flow min-cut theorems are mathematical propositions in network flow theory. Approximate max-flow min-cut theorems deal with the relationship between maximum flow rate ("max-flow") and minimum cut ("min-cut") in a multi-commodity flow problem. The theorems have enabled the development of approximation algorithms for use in graph partition and related problems.
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical propositions in network flow theory
original url:
https://en.wikipedia.org/wiki/Approximate_max-flow_min-cut_theorem
date created:
date modified:
2024-01-04T17:16:42Z
main entity:
{"identifier":"Q25111170","url":"https://www.wikidata.org/entity/Q25111170"}
image:
fields total:
13
integrity:
14