Publication:4471358
From MaRDI portal
zbMath1092.68618MaRDI QIDQ4471358
Guy E. Blelloch, Daniel K. Blandford, Ian A. Kash
Publication date: 28 July 2004
68R10: Graph theory (including graph drawing) in computer science
Related Items
Unnamed Item, Some Typical Properties of the Spatial Preferred Attachment Model, Unnamed Item, A Geometric Preferential Attachment Model of Networks II, Fast and compact planar embeddings, Expansion and Lack Thereof in Randomly Perturbed Graphs, Building knowledge maps of web graphs, Succinct encoding of arbitrary graphs, Compact navigation and distance oracles for graphs with small treewidth, I/O-efficient path traversal in succinct planar graphs, Compact representation of graphs of small clique-width, Graph compression and the zeros of polynomials, Quick encoding of plane graphs in \(\log _{2}14\) bits per edge, Geometric inhomogeneous random graphs, Succinct representation of labeled graphs, GLOUDS: representing tree-like graphs, Succinct encoding of binary strings representing triangulations, Compact representation of graphs with bounded bandwidth or treedepth, Compact Navigation and Distance Oracles for Graphs with Small Treewidth, Efficient Compression of Web Graphs, Succinct Representations of Arbitrary Graphs