Skip to main content
. Author manuscript; available in PMC: 2016 Mar 1.
Published in final edited form as: Data Min Knowl Discov. 2014 May 14;29(2):423–465. doi: 10.1007/s10618-014-0351-4

Table 1.

Acronyms used in this paper

Acronym Expansion
BCH Betweenness centrality critical node heuristic
CBH Covering based heuristic
ECH Eigenvalue centrality critical node heuristic
ED Exponential decay
ER Erdős–Renyi
HCH High degree critical node heuristic
HITS Hyperlink-induced topic search
MSC Minimum set cover
MVC Minimum vertex cover
PBH Potential based heuristic
RCH Random critical node heuristic
SCS-MNA Smallest critical set to minimize the number of new affected nodes
SCS-MUN Smallest critical set to maximize the number of unaffected nodes
SCS-SASN Smallest critical set to save all salvageable nodes
SF Scale free
SMC Set multicover
SyDS Synchronous dynamical system