Dilworth's Theorem Revisited, an Algorithmic Proof
2011-04-27
Research Paper
pp 1-7.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(EI2011-13.pdf, 0.1MB) |
Dilworth's theorem establishes a link between a minimal path cover and a maximal antichain in a digraph. A new proof for Dilworth's theorem is given. Moreover an algorithm to find both the path cover and the antichain, as considered in the theorem, is presented.
Automatically Extracted Terms
- network
- algorithm
- fl ow f
- antichain
- theorem
- fl ow network
- max flow algorithm
- dilworth
- proof
- graph
- section
- network n
- min flow algorithm
- min flow
- capacity
- fi nding
- figure
- digraph
- value
- number
