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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 28; H. 1; S. 113 - 126
Hauptverfasser:	Chen Chen, Hanghang Tong, Prakash, B. Aditya, Tsourakakis, Charalampos E., Eliassi-Rad, Tina, Faloutsos, Christos, Duen Horng Chau
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.01.2016
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!