Simulation computation in grammar-compressed graphs
Stefan B\"ottcher, Rita Hartel, Sven Peeters
TL;DR
This paper introduces an algorithm for simulation computation in grammar-compressed graphs, significantly improving speed over previous methods, especially on larger and more compressed graphs.
Contribution
It extends simulation algorithms to operate directly on grammar-compressed graphs, enabling faster processing compared to uncompressed graph algorithms.
Findings
Speed-up increases with graph size
Performance improves with higher compression
Effective on large, highly compressed graphs
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Algorithms and Data Compression · Natural Language Processing Techniques