Directed width parameters and circumference of digraphs

DOI10.1016/j.tcs.2016.10.010zbMath1357.05052arXiv1401.2662OpenAlexW2407066649MaRDI QIDQ730003

Shiva Kintali

Publication date: 23 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.2662

zbMATH Keywords

directed treewidthDAG-widtharboreal decompositionDAG-decompositionKelly decompositionKelly-width

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A Menger-like property of tree-cut width ⋮ Digraphs of Bounded Width

Cites Work

• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• The dag-width of directed graphs
• Digraph measures: Kelly decompositions, games, and orderings
• Recognizing digraphs of Kelly-width 2
• Directed tree-width
• DAG-width
• Tree-width and circumference of graphs
• Circumference and Pathwidth of Highly Connected Graphs
• DAG-Width and Parity Games

This page was built for publication: Directed width parameters and circumference of digraphs