# Title: Constant-Delay Traversal of Grammar-Compressed Graphs

—
filed under:
Lab Lunch

Speaker: Fabian Peternek

**Abstract**

I will briefly present a method to traverse specific graphs compressed using hyperedge-replacement graph grammars such that a single step needs constant time (given the grammars rank is bounded by a constant). The talk will also give some intuition into why previous methods used to traverse grammar-compressed strings and trees fail to generalize to graphs. Time permitting, I may finish with a few minutes on a non-technical but somewhat related topic.