The number of depth-first searches of an ordered set-Reference-Cited by-同舟云学术

The number of depth-first searches of an ordered set

Published:1989 Issue:3 Volume:6 Page:295-303
ISSN:0167-8094
Container-title:Order
language:en
Short-container-title:Order

Author:

Kierstead H. A.,Trotter W. T.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/BF00563529.pdf

Reference5 articles.

1. 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.

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

3. M.Habib (1988) Problem 4.2, inAlgorithms and Order (ed. I.Rival), Kluwer Academic Publishers, Dordrecht.

4. 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.

5. H. A.Kierstead (1986) NP-Completeness results concerning greedy and super greedy linear extensions,Order 3, 123?134.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Greedy balanced pairs in N-free ordered sets;Discrete Applied Mathematics;2021-01

2. Planar Posets, Dimension, Breadth and the Number of Minimal Elements;Order;2015-08-26

3. Contiguity orders;Combinatorics and Computer Science;1996

4. A linear algorithm to decompose inheritance graphs into modules;Algorithmica;1995-06

5. Linear extensions with backtracking;Advances in Computing and Information — ICCI '91;1991