On computing the number of linear extensions of a tree

DOI10.1007/BF00383170MaRDI QIDQ1325960zbMATH OpenFDO

Authors V. Pereyra

Publication date 22 August 1994

Published in Order (Search for Journal in Brave)

zbMATH Keywords

treealgorithmcovering graphnumber of linear extensions of a poset

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Total orders (06A05)

Cited in

(13)

• scientific article; zbMATH DE number 409493 (Why is no real title available?)
• Volume computation for sparse Boolean quadric relaxations
• Linear extensions of N-free orders.
• The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest
• Treelike comparability graphs
• A quantitative study of pure parallel processes
• Counting Cherry reduction sequences in phylogenetic tree-child networks is counting linear extensions
• Counting linear extensions of posets with determinants of hook lengths
• A faster tree-decomposition based algorithm for counting linear extensions
• Counting linear extensions of posets with determinants of hook lengths
• A faster tree-decomposition based algorithm for counting linear extensions
• On the Galois Lattice of Bipartite Distance Hereditary Graphs
• Counting linear extensions: parameterizations by treewidth

This page was built for publication: On computing the number of linear extensions of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325960)