Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …

We present Spine, an efficient algorithm for finding the" backbone" of an influence network.
Given a social graph and a log of past propagations, we build an instance of the …

We propose to compress weighted graphs (networks), motivated by the observation that
large networks of social, biological, or other relations can be complex to handle and …

Existing task allocation algorithms often fail to consider communication load and do not meet
the scalability requirements of large-scale systems in practical applications. Furthermore …

We propose a novel problem to simplify weighted graphs by pruning least important edges
from them. Simplified graphs can be used to improve visualization of a network, to extract its …

To offset the significant power demands of hard disk drives in computer systems, drives are
typically powered down during idle periods. This saves power, but accelerates duty cycle …

Event-based egocentric dynamic networks are an important class of networks widely seen in
many domains. In this paper, we present a visual analytics approach for these networks by …

We propose a novel problem to simplify weighted graphs by pruning least important edges
from them. Simplified graphs can be used to improve visualization of a network, to extract its …

Large graphs are difficult to represent, visualize, and understand. In this paper, we
introduce" gate graph" a new approach to perform graph simplification. A gate graph …

Automated construction of location graphs is instrumental but challenging, particularly in
logistics optimisation problems and agent-based movement simulations. Hence, we propose …