A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions | |||
| Property / full work available at URL | |||
| Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2019/10206/pdf/LIPIcs-IPEC-2018-5.pdf / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2920579836 / rank | |||
Normal rank | |||
| Property / title | |||
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (English) | |||
| Property / title: A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (English) / rank | |||
Normal rank | |||
Revision as of 11:04, 30 July 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
