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

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on knowledge and data engineering Ročník 28; číslo 1; s. 113 - 126
Hlavní autoři:	Chen Chen, Hanghang Tong, Prakash, B. Aditya, Tsourakakis, Charalampos E., Eliassi-Rad, Tina, Faloutsos, Christos, Duen Horng Chau
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.01.2016
Témata:	Approximation methods Computational complexity Computers Eigenvalues and eigenfunctions Electronic mail Graph Mining Immune system Immunization Robustness Scalability graph mining Immunization scalability
ISSN:	1041-4347
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!