Pages that link to "Item:Q786030"
From MaRDI portal
The following pages link to A faster tree-decomposition based algorithm for counting linear extensions (Q786030):
Displaying 8 items.
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Using TPA to count linear extensions (Q1757459) (← links)
- Polynomial algorithms to count linear extensions in certain posets (Q3972873) (← links)
- Generating Linear Extensions Fast (Q4291563) (← links)
- Counting Linear Extensions: Parameterizations by Treewidth (Q4606310) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- Fast Counting with Bounded Treewidth (Q5505573) (← links)
- (Q5883508) (← links)