Sidney, J.B., Steiner, G.: Optimal sequencing by modular decomposition: polynomial algorithms. Oper. Res.(1986) 34, 606-612. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Recognition Algorithms for Orders of Small Width and.. - Felsner, Raghavan.. (Correct)
....The width of a partially ordered set is the size of its largest antichain. Orders of small width are a particularly attractive class since several optimization problems, known to be intractable for general orders as can be solved in polynomial time when the input is restricted to this class [3, 27, 26, 10]. It is therefore desirable to have fast recognition algorithms for orders of small width. Since the width of an n element order can be obtained using a max ow computation on a bipartite network with unit capacities there is a O(n 5=2 ) recognition algorithm. For special classes of orders much ....
J.B. Sidney and G. Steiner. Optimal sequencing by modular decomposition: polynomial algorithms. Operations Research, 34, 606-612, 1986.
Sequencing Groups of Jobs under Precedence Constraints - Shafransky (2000) (Correct)
No context found.
Sidney, J.B., Steiner, G.: Optimal sequencing by modular decomposition: polynomial algorithms. Oper. Res.(1986) 34, 606-612.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC