An analysis of the graph processing landscape
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 …
the networks they represent, and the computational approaches to this exploration take on …
[HTML][HTML] Buffering updates enables efficient dynamic de Bruijn graphs
Abstract Motivation: The de Bruijn graph has become a ubiquitous graph model for
biological data ever since its initial introduction in the late 1990s. It has been used for a …
biological data ever since its initial introduction in the late 1990s. It has been used for a …
Faster compressed quadtrees
Real-world point sets tend to be clustered, so using a machine word for each point is
wasteful. In this paper we first bound the number of nodes in the quad tree for a point set in …
wasteful. In this paper we first bound the number of nodes in the quad tree for a point set in …
A practical succinct dynamic graph representation
ME Coimbra, J Hrotkó, AP Francisco… - Information and …, 2022 - Elsevier
We address the problem of representing dynamic graphs using k 2-trees. The k 2-tree data
structure is one of the succinct data structures proposed for representing static graphs, and …
structure is one of the succinct data structures proposed for representing static graphs, and …
PK-Graph: Partitioned -Trees to Enable Compact and Dynamic Graphs in SparkGraphX
Graphs are becoming increasingly larger, with datasets having millions of vertices and
billions (or even trillions) of edges. As a result, the ability to fit the entire graph into the main …
billions (or even trillions) of edges. As a result, the ability to fit the entire graph into the main …
[PDF][PDF] PK-Graph: Partitioned K 2-Tree Graph
BAC Morais - 2021 - tecnico.ulisboa.pt
Graphs are becoming increasingly larger, having millions of vertices and billions (or even
trillions) of edges in some cases. As a result, it's becoming harder and harder to fit the entire …
trillions) of edges in some cases. As a result, it's becoming harder and harder to fit the entire …
[ZITATION][C] A graph algorithm library based on compact data structures
JM Hrotko - 2021