Like [1], we present an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm works on a compressed graph grammar, instead of on the original graph. The speed-up of our algorithm compared to the algorithm in [1] grows with the size of the graph and with the compression strength.
@article{arxiv.2001.04760,
title = {Simulation computation in grammar-compressed graphs},
author = {Stefan Böttcher and Rita Hartel and Sven Peeters},
journal= {arXiv preprint arXiv:2001.04760},
year = {2020}
}