论文信息 - NP-completeness properties about linear extensions

NP-completeness properties about linear extensions

Following the pioneering work of Kierstead, we present here some complexity results about the construction of depth-first greedy linear extensions. We prove that the recognition of Dilworth partially ordered sets of height 2, as defined by Syslo, is NP-complete. This last result yields a new proof of the NP-completeness of the jump number problem, first proved by Pulleyblank.

Michel Habib | Vincent Bouchitte

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Rainer Schrader,et al. Algorithmic approaches to setup minimization , 1985, SIAM J. Comput..

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

[5] Michel Habib,et al. Nombre de sauts et graphes série-parallèles , 1979, RAIRO Theor. Informatics Appl..

[6] M. Yannakakis. The Complexity of the Partial Order Dimension Problem , 1982 .

[7] Ivan Rival. Optimal linear extensions by interchanging chains , 1983 .

[8] Henry A. Kierstead. NP-Completeness results concerning greedy and super greedy linear extensions , 1986 .

[9] P. Winkler,et al. Minimizing setups for cycle-free ordered sets , 1982 .