Recognizing digraphs of Kelly-width 2
type: Item
instance of: scholarly article
title: Recognizing digraphs of Kelly-width 2
zbMATH Open document ID: 1216.05160
author: Daniel Meister
author: Jan Arne Telle
author: Martin Vatshelle
published in: Discrete Applied Mathematics
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5711865
zbMATH Keywords: digraph width parameter
zbMATH Keywords: Kelly-width
zbMATH Keywords: characterization
zbMATH Keywords: recognition
MaRDI profile type: Publication
full work available at URL: j.dam.2009.09.018
OpenAlex ID: W2024884639
cites work: Forbidden minors characterization of partial 3-trees
cites work: DAG-Width and Parity Games
cites work: Treewidth: Characterizations, Applications, and Computations
cites work: Fugitive-search games on graphs and related parameters
cites work: Digraph measures: Kelly decompositions, games, and orderings
cites work: Directed tree-width
cites work: DAG-width
cites work: Mathematical Foundations of Computer Science 2005
cites work: All structured programs have small tree width and good register allocation
DOI: 10.1016/J.DAM.2009.09.018
description: scientific article; zbMATH DE number 5711865