We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...
Pal Roe Sundsoy, Johannes Bjelland, Geoffrey Canri...
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
Abstract. We present a framework for statistical analysis in large cohorts of structural brain connectivity, derived from diffusion weighted MRI. A brain network is defined betwe...
Renske de Boer, Michiel Schaap, Fedde van der Lijn...