The number of depth-first searches of an ordered set

Henry Kierstead, W. T. Trotter

Research output: Contribution to journalArticle

3 Scopus citations

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

Keywords

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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'The number of depth-first searches of an ordered set'. Together they form a unique fingerprint.

  • Cite this