Fast Counting with Bounded Treewidth
type: Item
instance of: scholarly article
title: Fast Counting with Bounded Treewidth
zbMATH Open document ID: 1182.68278
DOI: 10.1007/978-3-540-89439-1_31
author: Michael Jakl
author: Reinhard Pichler
author: Stefan Rümmele
author: Stefan Woltran
published in: Logic for Programming, Artificial Intelligence, and Reasoning
publication date: 2009-01-27T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5498359
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-540-89439-1 31
OpenAlex ID: W2111738185
Recommended article: Counting and Enumeration Problems with Bounded Treewidth
Recommended article: On treewidth approximations
Recommended article: A faster tree-decomposition based algorithm for counting linear extensions
Recommended article: A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Recommended article: Efficient counting of square substrings in a tree
Recommended article: Efficient Counting of Square Substrings in a Tree
Recommended article: On Exact Algorithms for Treewidth
Recommended article: Approximation algorithms for treewidth
Recommended article: Exploiting Database Management Systems and Treewidth for Counting
Recommended article: Treewidth computations. I: Upper bounds
description: scientific article; zbMATH DE number 5498359