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.

中文翻译：

---

语法压缩图中的模拟计算

像 [1] 一样，我们提出了一种算法来计算标记节点和未标记边图中查询模式的模拟。然而，我们的算法适用于压缩图文法，而不是原始图。与 [1] 中的算法相比，我们的算法的加速随着图的大小和压缩强度的增加而增长。