Directed path-width and directed tree-width of directed co-graphs

DOI10.1007/978-3-319-94776-1_22OpenAlexW2810018852MaRDI QIDQ1790979

Frank Gurski, Carolin Rehs

Publication date: 4 October 2018

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

zbMATH Keywords

directed path-widthdirected tree-widthdirected co-graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

The knapsack problem with special neighbor constraints ⋮ Computing directed Steiner path covers ⋮ Solutions for subset sum problems with special digraph constraints ⋮ How to compute digraph width measures on directed co-graphs ⋮ Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Oriented coloring on recursively defined digraphs ⋮ On characterizations for subclasses of directed co-graphs ⋮ A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time ⋮ Comparing linear width parameters for directed graphs

This page was built for publication: Directed path-width and directed tree-width of directed co-graphs