Provides algorithms and complexity results for the δ-Dispersion and δ-Covering problems on bounded-treewidth graphs for integer, rational, and irrational distances.
2 Yousef Alavi, Jiuqiang Liu, Jianfang Wang, and Zhongfu Zhang
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.