20 citations · 21 across the 2 of their papers we have counts for
4 papers
Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank
Sebastian Maneth, Fabian Peternek
We present a pointer-based data structure for constant time traversal of the edges of an edge-labeled (alphabet ) directed hypergraph (a graph where edges can be incident to mor…
Grammar-Based Graph Compression
Sebastian Maneth, Fabian Peternek
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs…
A Survey on Methods and Systems for Graph Compression
Sebastian Maneth, Fabian Peternek
We present an informal survey (meant to accompany another paper) on graph compression methods. We focus on lossless methods, briefly list available pproaches, and compare them wher…
Compressed Tree Canonization
Markus Lohrey, Sebastian Maneth, Fabian Peternek
Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. It is well known that equivalence of SLT grammars is decidable in polyn…