Automata, Languages and Programming
type: Item
instance of: scholarly article
title: Automata, Languages and Programming
zbMATH Open document ID: 1099.68076
author: Fedor V. Fomin
author: Dieter Kratsch
author: Ioan Todinca
published in: Lecture Notes in Computer Science
publication date: 2005-08-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2198287
MaRDI profile type: Publication
full work available at URL: b99859
OpenAlex ID: W2505584480
DOI: 10.1007/B99859
Recommended article: Exact Algorithms for Treewidth and Minimum Fill-In
Recommended article: Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
Recommended article: On Exact Algorithms for Treewidth
Recommended article: On exact algorithms for treewidth
Recommended article: A revisit of the scheme for computing treewidth and minimum fill-in
Recommended article: Branching and Treewidth Based Exact Algorithms
Recommended article: Approximation algorithms for treewidth
Recommended article: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
Recommended article: Computing the treewidth and the minimum fill-in with the modular decomposition
description: scientific article; zbMATH DE number 2198287