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

• Type: Conference
• Year: 2003
• Where: SODA
• Authors: Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
• Keywords: Algorithms, N-vertex Unlabeled Graphs, SODA 2003