Computing digraph width measures on directed co-graphs (extended abstract)
From MaRDI portal
Publication:2291425
DOI10.1007/978-3-030-25027-0_20OpenAlexW2966002898MaRDI QIDQ2291425
Dominique Komander, Frank Gurski, Carolin Rehs
Publication date: 30 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-25027-0_20
Related Items (8)
The knapsack problem with special neighbor constraints ⋮ Computing directed Steiner path covers ⋮ Acyclic coloring parameterized by directed clique-width ⋮ 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 ⋮ On characterizations for subclasses of directed co-graphs
This page was built for publication: Computing digraph width measures on directed co-graphs (extended abstract)
