Provides algorithms and complexity results for the δ-Dispersion and δ-Covering problems on bounded-treewidth graphs for integer, rational, and irrational distances.
8 Alexander Grigoriev, Tim A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Continuous Defensive δ-Covering is Σ²_P-complete when attacks are restricted to vertices for large δ and NP-complete when attacks can be any points on the graph.
citing papers explorer
-
Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances
Provides algorithms and complexity results for the δ-Dispersion and δ-Covering problems on bounded-treewidth graphs for integer, rational, and irrational distances.
-
Continuous Defensive Domination Problems
Continuous Defensive δ-Covering is Σ²_P-complete when attacks are restricted to vertices for large δ and NP-complete when attacks can be any points on the graph.