The number of depth-first searches of an ordered set

Henry Kierstead, W. T. Trotter

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We show that the problems of deciding whether an ordered set has at least k depth-first linear extensions and whether an ordered set has at least k greedy linear extensions are NP-hard.

Original languageEnglish (US)
Pages (from-to)295-303
Number of pages9
JournalOrder
Volume6
Issue number3
DOIs
StatePublished - Sep 1989

Fingerprint

Depth-first Search
Linear Extension
Ordered Set
NP-complete problem

Keywords

  • AMS subject classifications (1980): 06A10, 68C25
  • Depth-first linear extension
  • greedy linear extension
  • NP-complete
  • ordered set

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

The number of depth-first searches of an ordered set. / Kierstead, Henry; Trotter, W. T.

In: Order, Vol. 6, No. 3, 09.1989, p. 295-303.

Research output: Contribution to journalArticle

Kierstead, Henry ; Trotter, W. T. / The number of depth-first searches of an ordered set. In: Order. 1989 ; Vol. 6, No. 3. pp. 295-303.
@article{84116637b0324806a87a7d3823741054,
title = "The number of depth-first searches of an ordered set",
abstract = "We show that the problems of deciding whether an ordered set has at least k depth-first linear extensions and whether an ordered set has at least k greedy linear extensions are NP-hard.",
keywords = "AMS subject classifications (1980): 06A10, 68C25, Depth-first linear extension, greedy linear extension, NP-complete, ordered set",
author = "Henry Kierstead and Trotter, {W. T.}",
year = "1989",
month = "9",
doi = "10.1007/BF00563529",
language = "English (US)",
volume = "6",
pages = "295--303",
journal = "Order",
issn = "0167-8094",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - The number of depth-first searches of an ordered set

AU - Kierstead, Henry

AU - Trotter, W. T.

PY - 1989/9

Y1 - 1989/9

N2 - We show that the problems of deciding whether an ordered set has at least k depth-first linear extensions and whether an ordered set has at least k greedy linear extensions are NP-hard.

AB - We show that the problems of deciding whether an ordered set has at least k depth-first linear extensions and whether an ordered set has at least k greedy linear extensions are NP-hard.

KW - AMS subject classifications (1980): 06A10, 68C25

KW - Depth-first linear extension

KW - greedy linear extension

KW - NP-complete

KW - ordered set

UR - http://www.scopus.com/inward/record.url?scp=34249976866&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249976866&partnerID=8YFLogxK

U2 - 10.1007/BF00563529

DO - 10.1007/BF00563529

M3 - Article

AN - SCOPUS:34249976866

VL - 6

SP - 295

EP - 303

JO - Order

JF - Order

SN - 0167-8094

IS - 3

ER -