A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.IPEC.2018.5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.IPEC.2018.5 / rank | |||
Normal rank | |||
Latest revision as of 15:36, 30 December 2024
scientific article; zbMATH DE number 7378591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions |
scientific article; zbMATH DE number 7378591 |
Statements
4 August 2021
0 references
algorithm selection
0 references
empirical hardness
0 references
linear extension
0 references
multiplication of polynomials
0 references
tree decomposition
0 references
0 references
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (English)
0 references
