The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
Tianyi Wang, Yang Chen, Zengbin Zhang, Peng Sun, B...
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...