On computing the number of linear extensions of a tree
From MaRDI portal
Publication:1325960
DOI10.1007/BF00383170zbMath0793.06002MaRDI QIDQ1325960
Publication date: 22 August 1994
Published in: Order (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Total orders (06A05)
Related Items (11)
On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ Counting linear extensions of posets with determinants of hook lengths ⋮ A quantitative study of pure parallel processes ⋮ Counting linear extensions: parameterizations by treewidth ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ Treelike comparability graphs ⋮ The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest ⋮ A faster tree-decomposition based algorithm for counting linear extensions ⋮ Counting Linear Extensions of Posets with Determinants of Hook Lengths ⋮ Linear extensions of N-free orders.
Cites Work
This page was built for publication: On computing the number of linear extensions of a tree
