Traversing Grammar-Compressed Trees with Constant Delay

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Conference object , Contribution for newspaper or weekly magazine 01 Mar 2016Embargo end date: 01 Jan 2015 United Kingdom Publisher:IEEEJournal:2016 Data Compression Conference (DCC)

Authors: Markus Lohrey; Sebastian Maneth; Carl Philipp Reh;

doi: 10.1109/dcc.2016.13 , 10.48550/arxiv.1511.02141

arXiv: 1511.02141

handle: 20.500.11820/6e7c108d-8c03-4aa7-91b9-83da6a0c4ed4

Traversing Grammar-Compressed Trees with Constant Delay

- Summary
- Subjects
- Metrics

Abstract

A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the i-th child, can be carried out in constant time. Moreover, we extend our data structure such that equality of subtrees can be checked in constant time.

Country

United Kingdom

Related Organizations

Keywords

FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average