Publication:2741376
From MaRDI portal
zbMath1072.05579MaRDI QIDQ2741376
Publication date: 23 September 2001
Full work available at URL: http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs, Unnamed Item, Directed Path-Decompositions, Unnamed Item, An algorithmic metatheorem for directed treewidth, Jumping robbers in digraphs, DAG-width is PSPACE-complete, The dag-width of directed graphs, Approximation algorithms for digraph width parameters, Digraph decompositions and monotonicity in digraph searching, Computing the zig-zag number of directed graphs, The all-or-nothing flow problem in directed graphs with symmetric demand pairs, Directed elimination games, Digraph measures: Kelly decompositions, games, and orderings, Digraph searching, directed vertex separation and directed pathwidth, Monotonicity in digraph search problems, A relaxation of the directed disjoint paths problem: a global congestion metric helps, Adapting the directed grid theorem into an \textsf{FPT} algorithm, How to compute digraph width measures on directed co-graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Digraphs of Bounded Width, Towards the Graph Minor Theorems for Directed Graphs
