Autor:	Carl Philipp Reh, Kurt Sieber
Rok vydání:	2020
Předmět:	Constant (mathematics) Data structure Algorithm Mathematics
Zdroj:	String Processing and Information Retrieval ISBN: 9783030592110 SPIRE
DOI:	10.1007/978-3-030-59212-7_2
Popis:	We present a data structure of linear size that allows to perform navigation steps and subtree equality checks in grammar-compressed forests in constant time. Navigation steps include going to the parent, to the left/right neighbor or to the first/last child.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::096a8bd2239fa850310c8a1e74a5ec8c https://doi.org/10.1007/978-3-030-59212-7_2 Zobrazit plný text záznamu