Tree compression using string grammars

Moses Ganardi, Danny Hucke, Markus Lohrey +1

We study the compressed representation of a ranked tree by a (string) straight-line program (SLP) for its preorder traversal, and compare it with the well-studied representation by…