Browsing Department of Informatics by Author "Bakkane, Brage I. K."

Now showing items 1-1 of 1

    • On the Hardness of Generalized Domination Problems Parameterized by Mim-Width 

      Bakkane, Brage I. K.; Jaffke, Lars (Journal article; Peer reviewed, 2022)
      For nonempty σ, ρ ⊆ ℕ, a vertex set S in a graph G is a (σ, ρ)-dominating set if for all v ∈ S, |N(v) ∩ S| ∈ σ, and for all v ∈ V(G) ⧵ S, |N(v) ∩ S| ∈ ρ. The Min/Max (σ,ρ)-Dominating Set problems ask, given a graph G and ...