Parametrised Algorithms for Directed Modular Width

  title={Parametrised Algorithms for Directed Modular Width},
  author={R. Steiner and S. Wiederrecht},
  • R. Steiner, S. Wiederrecht
  • Published in CALDAM 2020
  • Mathematics, Computer Science
  • Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on measuring how close a digraph is to an oriented tree resp. a directed acyclic graph, in this paper, we investigate directed modular width as a parameter, which is closer to the concept of clique-width. We investigate applications of modular decompositions of… CONTINUE READING
    3 Citations
    Acyclic coloring of special digraphs
    • 2
    • Highly Influenced
    • PDF
    Digraph Coloring and Distance to Acyclicity
    • PDF


    Parameterized Algorithms for Modular-Width
    • 61
    • PDF
    DAG-Width and Parity Games
    • 136
    • PDF
    Directed NLC-width
    • 16
    An algorithmic metatheorem for directed treewidth
    • M. Oliveira
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 2016
    • 5
    • PDF
    Are There Any Good Digraph Width Measures?
    • 56
    • PDF
    Directed Path-Width and Directed Tree-Width of Directed Co-graphs
    • 13
    Graph Minors. II. Algorithmic Aspects of Tree-Width
    • 1,512
    Rank-width and vertex-minors
    • Sang-il Oum
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 2005
    • 190
    • PDF