Directed tree-width examples

DOI10.1016/j.jctb.2006.12.006zbMath1122.05039OpenAlexW2079873939MaRDI QIDQ2642009

Isolde Adler

Publication date: 20 August 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.12.006

zbMATH Keywords

directed graphstree-widthdirected tree-widthmonotone robber and cops gamerobber and cops game

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

On the monotonicity of process number ⋮ Digraph Decompositions and Monotonicity in Digraph Searching ⋮ Cut-sufficient directed 2-commodity multiflow topologies ⋮ The all-or-nothing flow problem in directed graphs with symmetric demand pairs ⋮ Monotonicity of strong searching on digraphs ⋮ Directed NLC-width ⋮ The dag-width of directed graphs ⋮ Digraph width measures in parameterized algorithmics ⋮ Digraph measures: Kelly decompositions, games, and orderings ⋮ Digraph searching, directed vertex separation and directed pathwidth ⋮ Digraphs of directed treewidth one ⋮ LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth ⋮ LIFO-Search on Digraphs: A Searching Game for Cycle-Rank ⋮ A relaxation of the directed disjoint paths problem: a global congestion metric helps ⋮ Tree-Width for First Order Formulae ⋮ Digraphs of Bounded Width

Cites Work

• Graph searching and a min-max theorem for tree-width
• Directed tree-width

This page was built for publication: Directed tree-width examples