Sciweavers

Share
SODA
2003
ACM
139views Algorithms» more  SODA 2003»
9 years 5 months ago
Compact representations of separable graphs
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
books