New upper bound for m-eternal domination on cactus graphs, equality of three variants on Christmas cactus graphs, and linear-time algorithm.
Depth-first search and linear graph algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the m-eternal Domination Number of Cactus Graphs
New upper bound for m-eternal domination on cactus graphs, equality of three variants on Christmas cactus graphs, and linear-time algorithm.