Sciweavers

Share
SODA
2003
ACM

Compact representations of separable graphs

9 years 4 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 graphs that satisfy an O(nc )-separator the
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SODA
Authors Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
Comments (0)
books