Node Immunization on Large Graphs: Theory and Algorithms

Given a large graph, like a computer communication network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? This problem, referred to as the node immunization problem, is the core building block in many high-impact applicati...

Full description

Bibliographic Details

Published in:	IEEE transactions on knowledge and data engineering Vol. 28; no. 1; pp. 113 - 126
Main Authors:	Chen Chen, Hanghang Tong, Prakash, B. Aditya, Tsourakakis, Charalampos E., Eliassi-Rad, Tina, Faloutsos, Christos, Duen Horng Chau
Format:	Journal Article
Language:	English
Published:	IEEE 01.01.2016
Subjects:	Approximation methods Computational complexity Computers Eigenvalues and eigenfunctions Electronic mail Graph Mining Immune system Immunization Robustness Scalability graph mining Immunization scalability
ISSN:	1041-4347
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!