Simulation computation in grammar-compressed graphs

01/14/2020

∙

by   Stefan Böttcher, et al.

∙

0

∙

share

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.