论文信息 - Another Note on Dilworth's Decomposition Theorem

Another Note on Dilworth's Decomposition Theorem

This paper proposes a new proof of Dilworth's theorem. The proof is based upon the minflow/maxcut property in flow networks. In relation to this proof, a new method to find both a Dilworth decomposition and a maximal antichain is presented.

Wim Pijls | Rob Potharst

[1] Eleonor Ciurea,et al. Sequential and parallel algorithms for minimum flows , 2004 .

[2] D. R. Fulkerson. Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .

[3] Bernard De Baets,et al. Optimal monotone relabelling of partially non-monotone ordinal data , 2012, Optim. Methods Softw..

[4] András A. Benczúr,et al. Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems , 2003, Discret. Appl. Math..

[5] Fred Galvin,et al. A Proof of Dilworth's Chain Decomposition Theorem , 1994 .

[6] Jean-Xavier Rampon,et al. Computing on-line the lattice of maximal antichains of posets , 1994 .

[7] H. Daniels,et al. Derivation of monotone decision models from noisy data , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[8] R. Möhring. Algorithmic Aspects of Comparability Graphs and Interval Graphs , 1985 .

[9] Helge Tverberg,et al. On Dilworth's decomposition theorem for partially ordered sets , 1967 .

[10] Micha A. Perles. A proof of dilworth’s decomposition theorem for partially ordered sets , 1963 .

[11] Stefan Felsner,et al. Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number , 2003, Order.

[12] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .