K-shield enhances Netshield by using random spanning forests to improve selection of k nodes that minimize the largest eigenvalue of the remaining graph's adjacency matrix, at identical computational cost.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Network node immunization: improving Netshield algorithm through random rooted forests
K-shield enhances Netshield by using random spanning forests to improve selection of k nodes that minimize the largest eigenvalue of the remaining graph's adjacency matrix, at identical computational cost.