Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Implicit Hitting Set Enumeration for Power Dominating Sets
Thomas Bläsius, Max Göttlicher, Martin Schirneck
The Transversal Hypergraph problem asks to enumerate (list) all inclusion-minimal hitting sets of a hypergraph. It usually assumes that the input is completely known and does not c…
cs.CC2026
From FPT to W[P]: Classifying Zero Forcing, Power Domination and Their Variants
Max Göttlicher, Lennard Hofmann, Christoph Niederbudde
Zero Forcing (ZF) and Power Dominating Set (PDS) mark vertices in a graph based on a common forcing process starting from a problem-specific set of initially marked vertices. ZF in…