The number of depth-first searches of an ordered set
type: Item
instance of: scholarly article
title: The number of depth-first searches of an ordered set
zbMATH Open document ID: 0695.06002
DOI: 10.1007/BF00563529
author: H. A. Kierstead
author: William T. Trotter
published in: Order
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4137824
zbMATH Keywords: NP-complete
zbMATH Keywords: depth-first linear extensions
zbMATH Keywords: greedy linear extensions
zbMATH Keywords: NP- hard
MaRDI profile type: Publication
cites work: The complexity of theorem-proving procedures
cites work: Q4198056
cites work: NP-completeness results concerning greedy and super greedy linear extensions
full work available at URL: https://doi.org/10.1007/bf00563529
OpenAlex ID: W1969845931
Recommended article: On the number of deepest nodes in ordered trees
Recommended article: Q5284063
Recommended article: Computing depth orders and related problems
Recommended article: An optimal algorithm to find the jump number of partially ordered sets
Recommended article: The number of hierarchical orderings
Recommended article: The estimate of the number of permutationally-ordered sets
Recommended article: On the number of orderings of \(n\) items
Recommended article: Depth-First Search Using $$O(n)$$ Bits
Recommended article: On the complexity of recursive path orderings
Recommended article: The recursive structure of some ordering problems
description: scientific article; zbMATH DE number 4137824