Dilworth's Theorem Revisited, an Algorithmic Proof
AbstractDilworth'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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 2011-13.
Date of creation: 27 Apr 2011
Date of revision:
Contact details of provider:
Web page: http://www.few.eur.nl/few
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-05-07 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If references are entirely missing, you can add them using this form.