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.

Pijls, W.H.L.M.

Potharst, R.

Research Papers in Economics

English

A decomposition theorem for partially ordered sets,

A Proof of Dilworth's Chain Decomposition Theorem,

A proof of Dilworth's decomposition theorem for partially ordered sets,

Algorithmic aspects of comparability graphs and interval graphs. In: Graphs and Order,

Combinatorial Optimization,

Combinatorial Optimization, Polyhedra and E±ciency,

Network °ows: Theory, Algorithms, and Applications,

On Dilworth's decomposition theorem for partially ordered sets,

Optimal resolution of reversed preference in multi-criteria data-sets,

Sequential and parallel algorithms for minimum °ows,

Dilworth's Theorem Revisited, an Algorithmic Proof