The article introduces an algorithm for enumerating MSO-queries on compressed trees using forest straight-line programs (FSLPs). It discusses the paradigm of algorithmics on compressed data and the advantages of working directly on compressed data objects. The core idea is to represent trees using directed acyclic graphs (DAGs) and apply forest algebra for compression. The algorithm aims to enumerate query results efficiently with linear preprocessing and output-linear delay.
A otro idioma
del contenido fuente
arxiv.org
Ideas clave extraídas de
by Markus Lohre... a las arxiv.org 03-06-2024
https://arxiv.org/pdf/2403.03067.pdfConsultas más profundas