Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Minimizing setups in ordered sets of fixed width;Colbourn;Order,1985
2. On some complexity properties of N-free posets and posets with bounded decomposition diameter;Habib;Discrete Math.,1987
3. Algorithmic aspects of comparability graphs and interval graphs;Möhring,1985
4. W.R. Pulleyblank, On minimizing setups in precedence-constrained scheduling, Discrete Appl. Math., to appear.
5. Optimal linear extensions by interchanging chains;Rival;Proc. Amer. Math. Soc.,1983
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献