A memory efficient reachability data structure through bit vector compression.
When answering many reachability queries on a large graph, the principal challenge is to represent the transitive closure of the graph compactly, while still allowing fast membership tests on that transitive closure. Recent attempts to address this problem are complex data structures and algorithms...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference item |
| Published: |
ACM
2011
|