Constant delay traversal of grammar-compressed graphs with bounded rank.
Sebastian ManethFabian PeternekPublished in: Inf. Comput. (2020)
Keyphrases
- data structure
- decreasing function
- bounded treewidth
- graph theory
- context free grammars
- graph theoretic
- graph representation
- natural language
- data compression
- graph matching
- directed graph
- graph mining
- graph databases
- graph structure
- compressed domain
- small world
- context free
- graph grammars
- tree structure
- connected graphs