Parameterized algorithms for directed modular width

DOI10.1007/978-3-030-39219-2_33zbMath1453.68097arXiv1905.13203OpenAlexW3004208184MaRDI QIDQ779243

Sebastian Wiederrecht, Raphael Steiner

Publication date: 21 July 2020

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

zbMATH Keywords

integer linear programmingmodular decompositionfixed-parameter tractabilityparameterized complexitywidth measures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

Acyclic coloring parameterized by directed clique-width ⋮ Dominance drawings for DAGs with bounded modular width ⋮ How to compute digraph width measures on directed co-graphs ⋮ Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs

This page was built for publication: Parameterized algorithms for directed modular width