A faster tree-decomposition based algorithm for counting linear extensions
type: Item
instance of: scholarly article
title: A faster tree-decomposition based algorithm for counting linear extensions
zbMATH Open document ID: 1452.68265
author: Kustaa Kangas
author: Mikko Koivisto
author: Sami Salonen
published in: Algorithmica
publication date: 2020-08-12T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7233372
zbMATH Keywords: algorithm selection
zbMATH Keywords: empirical hardness
zbMATH Keywords: linear extension
zbMATH Keywords: multiplication of polynomials
zbMATH Keywords: tree decomposition
describes a project that uses: WEKA
describes a project that uses: htd
describes a project that uses: FLINT
MaRDI profile type: Publication
full work available at URL: s00453-019-00633-1
OpenAlex ID: W2960650218
cites work: Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
cites work: The Transitive Reduction of a Directed Graph
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: On computing the number of linear extensions of a tree
cites work: Using TPA to count linear extensions
cites work: Contribution to nonserial dynamic programming
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Tree decompositions with small cost
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Counting linear extensions
cites work: Bucket elimination: A unifying framework for reasoning
cites work: A random polynomial-time algorithm for approximating the volume of convex bodies
cites work: Counting linear extensions: parameterizations by treewidth
cites work: Faster Integer Multiplication
cites work: Fast Library for Number Theory: An Introduction
cites work: A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
cites work: Dynamic programming meets the principle of inclusion and exclusion
cites work: Empirical hardness models
cites work: Q5283021
cites work: Q4918387
cites work: Convex Rank Tests and Semigraphoids
cites work: Optimal partial-order plan relaxation via MaxSAT
cites work: Structure discovery in Bayesian networks by sampling partial orders
cites work: New results in minimum-comparison sorting
cites work: Q3851094
cites work: On the bit-complexity of sparse polynomial and series multiplication
Wikidata QID: Q127173469
DOI: 10.1007/S00453-019-00633-1
description: scientific article; zbMATH DE number 7233372