On the algorithmic effectiveness of digraph decompositions and complexity measures
type: Item
instance of: scholarly article
title: On the algorithmic effectiveness of digraph decompositions and complexity measures
zbMATH Open document ID: 1248.90073
author: Michael Lampis
author: Georgia Kaouri
author: Valia Mitsou
published in: Discrete Optimization
publication date: 2012-10-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6094038
zbMATH Keywords: treewidth
zbMATH Keywords: digraph decompositions
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.03.010
OpenAlex ID: W2149379116
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graph searching and a min-max theorem for tree-width
cites work: Fugitive-search games on graphs and related parameters
cites work: An algebraic theory of graph reduction
cites work: Treewidth: Structure and Algorithms
cites work: Treewidth: Characterizations, Applications, and Computations
cites work: Q4699283
cites work: Q3002818
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q5710169
cites work: On miniaturized problems in parameterized complexity theory
cites work: Directed tree-width
cites work: DAG-width
cites work: Q2934648
cites work: Digraph Decompositions and Monotonicity in Digraph Searching
cites work: On complexity of minimum leaf out-branching problem
cites work: Directed path-width and monotonicity in digraph searching
cites work: Transition graphs and the star-height of regular events
cites work: Finite Automata, Digraph Connectivity, and Regular Expression Size
cites work: On Digraph Width Measures in Parameterized Algorithmics
cites work: Optimization, approximation, and complexity classes
DOI: 10.1016/J.DISOPT.2010.03.010
description: scientific article; zbMATH DE number 6094038