1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Stefan Böttcher, Rita Hartel, Sven Peeters
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 g…