Computing digraph width measures on directed co-graphs (extended abstract)

DOI10.1007/978-3-030-25027-0_20MaRDI QIDQ2291425zbMATH OpenOpenAlexFDO

Authors Frank Gurski, Dominique Komander, Carolin Rehs

Publication date 30 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25027-0_20

zbMATH Keywords

cycle rankDAG-depthDAG-widthDFVS-numberdirected co-graphsKelly-width

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• How to compute digraph width measures on directed co-graphs
• Directed path-width and directed tree-width of directed co-graphs
• On digraph width measures in parameterized algorithmics
• Are there any good digraph width measures?
• Digraph width measures in parameterized algorithmics

Cited in

(8)

• On characterizations for subclasses of directed co-graphs
• 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
• Efficient computation of the oriented chromatic number of recursively defined digraphs
• Computing directed Steiner path covers for directed co-graphs (extended abstract)
• Acyclic coloring parameterized by directed clique-width

This page was built for publication: Computing digraph width measures on directed co-graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291425)