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 particular, we show constanttime support for adjacency, degree and neighborhood queries. For any monotone class of separable graphs, the storage requirement of the representation is optimal to within lower order terms. Separable graphs are those that admit a O(nc )-separator theorem

• Type: Journal
• Year: 2010
• Where: CPM
• Authors: Guy E. Blelloch, Arash Farzan
• Keywords: Combinatorics, CPM 2010, Logarithmic Word Size, Lower Order Terms, Separable Graphs