activity
20192021
most citedNew Algorithms for Mixed Dominating Set

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021

Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation

Louis Dublois, Michael Lampis, Vangelis Th. Paschos

An upper dominating set is a minimal dominating set in a graph. In the \textsc{Upper Dominating Set} problem, the goal is to find an upper dominating set of maximum size. We study…