## Decomposing Partial Orders into Chains

- P BK.
- Journal of Combinatorial Theory,
- 1950

@inproceedings{Kitchen2007AMF, title={A Min Flow Max Cut Theorem}, author={Andrew Kitchen}, year={2007} }

- Published 2007

Consider a network of pipes joining a set of intakes (the source) to a separate set of outlets (the e n sink), so that liquid flows from the intakes, through the network, to the outlets. A cross-section of th etwork, separating the intakes on one side from the outlets on the other, is called a cut. A minimal t c cut is one that, roughly speaking, slices… CONTINUE READING

### Presentations referencing similar topics