We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
Paolo Boldi, Marco Rosa, Massimo Santini, Sebastia...
An energy-efficient opportunistic collaborative beamformer with one-bit feedback is proposed for ad hoc sensor networks over Rayleigh fading channels. In contrast to conventional c...
In this paper, we introduce a game-theoretic framework to address the community detection problem based on the structures of social networks. We formulate the dynamics of community...
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...