Compressed Tree Canonization
From MaRDI portal
Publication:3449487
DOI10.1007/978-3-662-47666-6_27zbMath1440.68148arXiv1502.04625OpenAlexW1630690066MaRDI QIDQ3449487
Fabian Peternek, Markus Lohrey, Sebastian Maneth
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.04625
Related Items
Compressed Tree Canonization ⋮ Grammar-Based Tree Compression ⋮ Grammar-based compression of unranked trees
Cites Work
- Unnamed Item
- Unnamed Item
- Parameter reduction and automata evaluation for grammar-compressed trees
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- Deciding bisimilarity is P-complete
- Completeness results for graph isomorphism.
- Isomorphism of regular trees and words
- Algorithmics on SLP-compressed strings: A survey
- A Comparison of Succinctly Represented Finite-State Systems
- Succinct representations of graphs
- Compressed Tree Canonization
- The Smallest Grammar Problem
- Succinct Encodings of Graph Isomorphism