7 citations · 13 across the 14 of their papers we have counts for
Showing 2023 · cs.DSShow all
2 papers · 2 filters
cs.DS2023
An Efficient Algorithm for Power Dominating Set
Thomas Bläsius, Max Göttlicher
The problem Power Dominating Set (PDS) is motivated by the placement of phasor measurement units to monitor electrical networks. It asks for a minimum set of vertices in a graph th…
cs.DS2023
Partitioning the Bags of a Tree Decomposition Into Cliques
Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
We consider a variant of treewidth that we call clique-partitioned treewidth in which each bag is partitioned into cliques. This is motivated by the recent development of FPT-algor…