4 papers
On dynamic succinct graph representations
Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo +3
We address the problem of representing dynamic graphs using -trees. The -tree data structure is one of the succinct data structures proposed for representing static graph…
An analysis of the graph processing landscape
Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
The value of graph-based big data can be unlocked by exploring the topology and metrics of the networks they represent, and the computational approaches to this exploration take on…
VeilGraph: Streaming Graph Approximations
Miguel E. Coimbra, Sérgio Esteves, Alexandre P. Francisco +1
Graphs are found in a plethora of domains, including online social networks, the World Wide Web and the study of epidemics, to name a few. With the advent of greater volumes of inf…
Study on Resource Efficiency of Distributed Graph Processing
Miguel E. Coimbra, Alexandre P. Francisco, Luis Veiga
Graphs may be used to represent many different problem domains -- a concrete example is that of detecting communities in social networks, which are represented as graphs. With big…