scientific article
From MaRDI portal
Publication:2741376
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
An algorithmic metatheorem for directed treewidth ⋮ Computing the zig-zag number of directed graphs ⋮ Adapting the directed grid theorem into an \textsf{FPT} algorithm ⋮ Towards the Graph Minor Theorems for Directed Graphs ⋮ Jumping robbers in digraphs ⋮ DAG-width is PSPACE-complete ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ The all-or-nothing flow problem in directed graphs with symmetric demand pairs ⋮ Directed elimination games ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Digraph decompositions and monotonicity in digraph searching ⋮ The dag-width of directed graphs ⋮ How to compute digraph width measures on directed co-graphs ⋮ Digraph measures: Kelly decompositions, games, and orderings ⋮ Approximation algorithms for digraph width parameters ⋮ Digraph searching, directed vertex separation and directed pathwidth ⋮ Monotonicity in digraph search problems ⋮ Unnamed Item ⋮ Directed Path-Decompositions ⋮ A relaxation of the directed disjoint paths problem: a global congestion metric helps ⋮ Digraphs of Bounded Width ⋮ Unnamed Item
This page was built for publication:
