Efficiently spotting the starting points of an epidemic in a large graph

Author： Prakash B.   Vreeken Jilles   Faloutsos Christos  

Publisher： Springer Publishing Company

ISSN： 0219-1377

Source： Knowledge and Information Systems, Vol.38, Iss.1, 2014-01, pp. : 35-59

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Evaluating holistic aggregators efficiently for very large datasets

By Fu Lixin  

The VLDB Journal, Vol. 13, Iss. 2, 2004-05 ,pp. : 148-161

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic load balancing efficiently in a large-scale cluster

By Zhang Bao-Yin  

International Journal of High Performance Computing and Networking, Vol. 6, Iss. 2, 2009-07 ,pp. : 100-105

Inderscience Publishers

Access to resources Recommend Favorite

Finding Frequent Patterns in a Large Sparse Graph*

By Kuramochi Michihiro   Karypis George  

Data Mining and Knowledge Discovery, Vol. 11, Iss. 3, 2005-11 ,pp. : 243-271

Springer Publishing Company

Access to resources Recommend Favorite

A graph-based clustering algorithm in large transaction

By Chen N.  

Intelligent Data Analysis, Vol. 5, Iss. 4, 2001-01 ,pp. : 327-338

Ios Press

Access to resources Recommend Favorite

Woven convolutional graph codes with large free distances

By Bocharova I.   Hug F.   Johannesson R.   Kudryashov B.  

Problems of Information Transmission, Vol. 47, Iss. 1, 2011-03 ,pp. : 1-14

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite