1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Enno Adler, Stefan Böttcher, Rita Hartel
Neighborhood queries and triple queries are the most common queries on graphs; thus, it is desirable to answer them efficiently on compressed data structures. We present a compress…