Pages that link to "Item:Q1325960"
From MaRDI portal
The following pages link to On computing the number of linear extensions of a tree (Q1325960):
Displaying 13 items.
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- A quantitative study of pure parallel processes (Q907263) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest (Q2314426) (← links)
- Linear extensions of N-free orders. (Q2351714) (← links)
- Counting linear extensions of posets with determinants of hook lengths (Q2680941) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- (Q4203044) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- Counting Linear Extensions of Posets with Determinants of Hook Lengths (Q5854455) (← links)
- Counting Cherry reduction sequences in phylogenetic tree-child networks is counting linear extensions (Q6639832) (← links)