The dag-width of directed graphs
type: Item
instance of: scholarly article
title: The dag-width of directed graphs
zbMATH Open document ID: 1246.05065
author: Dietmar Berwanger
author: Anuj Dawar
author: Paul Hunter
author: Stephan Kreutzer
author: Jan Obdržálek
published in: Journal of Combinatorial Theory. Series B
publication date: 2012-08-14T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C57
zbMATH DE Number: 6065694
zbMATH Keywords: structural graph theory
zbMATH Keywords: directed graph decompositions
zbMATH Keywords: graph searching games
zbMATH Keywords: parity games
zbMATH Keywords: digraph algorithms
Wikidata QID: Q58215516
MaRDI profile type: Publication
full work available at URL: j.jctb.2012.04.004
OpenAlex ID: W2127618440
cites work: Directed tree-width examples
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Directed path-width and monotonicity in digraph searching
cites work: DAG-Width and Parity Games
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Q4699283
cites work: Alternation
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Fugitive-search games on graphs and related parameters
cites work: Q5315023
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
cites work: Digraph measures: Kelly decompositions, games, and orderings
cites work: Directed tree-width
cites work: Searching and pebbling
cites work: Results on the propositional \(\mu\)-calculus
cites work: Digraph Decompositions and Monotonicity in Digraph Searching
cites work: Computer Aided Verification
cites work: DAG-width
cites work: Clique-Width and Parity Games
cites work: Introducing directed tree width
cites work: Graph minors. III. Planar tree-width
cites work: Mathematical Foundations of Computer Science 2005
cites work: Graph searching and a min-max theorem for tree-width
DOI: 10.1016/J.JCTB.2012.04.004
description: scientific article; zbMATH DE number 6065694