Presents a pointer-based data structure enabling constant-time traversal of edges in grammar-compressed hypergraphs with bounded rank and per-vertex edge uniqueness constraints, with stated preprocessing bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank
Presents a pointer-based data structure enabling constant-time traversal of edges in grammar-compressed hypergraphs with bounded rank and per-vertex edge uniqueness constraints, with stated preprocessing bounds.