The paper refines single-edge-deletion bounds for the majority domination number and derives accuracy inequalities for tree, complete, and regular graph surrogates, but the promised heuristic accuracy guarantees are not supported.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Pairwise similarity method for majority domination problem
The paper refines single-edge-deletion bounds for the majority domination number and derives accuracy inequalities for tree, complete, and regular graph surrogates, but the promised heuristic accuracy guarantees are not supported.