Sciweavers

CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
13 years 6 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan