Skip to main content
SpringerLink
Log in

NP-completeness properties about linear extensions

  • Published:
Order Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. Bouchitte, M. Habib, M. Hamroun, and R. Jegou (1986) Depth-first search and linear extensions, Rapport de recherche No. 5, ENST de Bretagne, Brest.

    Google Scholar 

  2. O. Cogis and M. Habib (1979) Nombre de sauts et graphes série-parallèles, RAIRO Inf. Th. 13, 3–18.

    Google Scholar 

  3. S. A. Cook (1971) The complexity of theorem-proving procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing, New York, pp. 151–158.

  4. R. P. Dilworth (1950) A decomposition theorem for partially ordered sets, Ann. Math. 51, 161–166.

    Google Scholar 

  5. D. Duffus, I. Rival, and P. Winkler (1985) Minimizing setups for cycle-free ordered sets, Proc. A. M. S. 85, 509–513.

    Google Scholar 

  6. U. Faigle, G. Gierz, and R. Schrader (1985) Algorithmic approaches to set-up minimization, SIAM J. Computing 14, 954–965.

    Google Scholar 

  7. M. R. Garey and D. S. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco.

    Google Scholar 

  8. H. A. Kierstead (1986) NP-completeness results concerning greedy and super greedy linear extensions, Order 3, 123–134.

    Google Scholar 

  9. O. Pretzel (1985) Problem, presented at Oberwolfach Conference on Combinatorics and Ordered Sets.

  10. W. R. Pulleyblank, On minimizing setups in precedence constrained scheduling, Discrete Math., to appear.

  11. I. Rival (1983) Optimal linear extensions by interchanging chains, Proc. A. M. S. 83, 387–394.

    Google Scholar 

  12. M. M. Syslo (1985) Remarks on Dilworth partially ordered sets, in H. Noltemeier (ed.) Proc. WG'85, Traubner-Verlag, Linz, pp. 355–362.

    Google Scholar 

  13. M. M. Syslo, K. M. Koh, and W. L. Chia (1987) A characterization of bipartite Dilworth posets, Int. Conf. on Optimization Techniques and Applications, World Scientific, Singapore, pp. 451–459.

  14. M. Yannakakis (1982) The complexity of the partial order dimension problem, SIAM J. Alg. Disc. Math. 3, 351–358.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département Informatique Appliquée, Ecole des Mines de Saint-Etienne, 158 cours Fauriel, 42023, Saint-Etienne cedex 2, France

    Vincent Bouchitte

  2. LIB (Laboratoire commun ENST Br et UBO), Département Informatique et Réseaux, Ecole Nationale Supérieure des Télécommunications de Bretagne, ZI de Kernevent, BP 832, 29285, Brest cedex, France

    Michel Habib

Authors
  1. Vincent Bouchitte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Habib
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by R. Möhring

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouchitte, V., Habib, M. NP-completeness properties about linear extensions. Order 4, 143–154 (1987). https://doi.org/10.1007/BF00337693

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00337693

AMS subject classifications (1980)

Key words

Search

Navigation