Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

49

CPM
2010
Springer

favoriteEmaildiscussreport

145views Combinatorics» more CPM 2010»

Succinct Representations of Separable Graphs

13 years 5 months ago

Succinct Representations of Separable Graphs

Download www.cs.cmu.edu

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

Guy E. Blelloch, Arash Farzan

Real-time Traffic

Combinatorics | CPM 2010 | Logarithmic Word Size | Lower Order Terms | Separable Graphs |

claim paper

Related Content

» Succinct Representation of Labeled Graphs

» Succinct Representations of Arbitrary Graphs

» Optimal succinct representations of planar maps

» Succinct representations of planar maps

» Succinct Greedy Graph Drawing in the Hyperbolic Plane

» A Simple Optimal Representation for Balanced Parentheses

» Representing the Internet as a succinct forest

» Compact representations of separable graphs

» A colour textgraphics separation based on a graph representation

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2010
Where	CPM
Authors	Guy E. Blelloch, Arash Farzan

Comments (0)