Proves NP- and ΣP2-completeness for variants of a graph game modeling defender controller placement against vertex attacks, with polynomial algorithms for interval graphs and bounded treewidth.
42 Jack Robertson and William Webb.Cake-Cutting Algorithms: Be Fair if You Can
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Modelling Network Resilience: The Complexity of Some Graph Division Games
Proves NP- and ΣP2-completeness for variants of a graph game modeling defender controller placement against vertex attacks, with polynomial algorithms for interval graphs and bounded treewidth.