Abstract
We show that the problems of deciding whether an ordered set has at leastk depth-first linear extensions and whether an ordered set has at leastk greedy linear extensions are NP-hard.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. A.Cook (1971) The complexity of theorem proving procedures,Proc. 3rd Ann. ACM Symp. on Theory of Computing, Association of Computing Machinery, New York, pp. 151–158.
M. R.Garey and D. S.Johnson (1979)Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
M.Habib (1988) Problem 4.2, inAlgorithms and Order (ed. I.Rival), Kluwer Academic Publishers, Dordrecht.
R. M.Karp (1972) Reducibility among combinatorial problems, inComplexity of Computer Computations (eds. R. E.Miller and J. W.Thatcher), Plenum Press, New York, pp. 85–103.
H. A.Kierstead (1986) NP-Completeness results concerning greedy and super greedy linear extensions,Order 3, 123–134.
Author information
Authors and Affiliations
Additional information
Communicated by D. Kelly
Supported by Office of Naval Research contract N00014-85K-0494.
Supported by National Science Foundation grant DMS-8713994.
Rights and permissions
About this article
Cite this article
Kierstead, H.A., Trotter, W.T. The number of depth-first searches of an ordered set. Order 6, 295–303 (1989). https://doi.org/10.1007/BF00563529
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00563529