scientific article; zbMATH DE number 2079399

zbMath1092.68618MaRDI QIDQ4471358

Guy E. Blelloch, Daniel K. Blandford, Ian A. Kash

Publication date: 28 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (25)

Graph compression and the zeros of polynomials ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ GLOUDS: representing tree-like graphs ⋮ Building knowledge maps of web graphs ⋮ Succinct encoding of binary strings representing triangulations ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ Succinct encoding of arbitrary graphs ⋮ Efficient Compression of Web Graphs ⋮ Succinct representation of labeled graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Geometric inhomogeneous random graphs ⋮ Succinct Representations of Arbitrary Graphs ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ A Geometric Preferential Attachment Model of Networks II ⋮ Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋮ I/O-efficient path traversal in succinct planar graphs ⋮ Some Typical Properties of the Spatial Preferred Attachment Model ⋮ Quick encoding of plane graphs in \(\log _{2}14\) bits per edge ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Compact representation of graphs of small clique-width ⋮ Fast and compact planar embeddings ⋮ Expansion and Lack Thereof in Randomly Perturbed Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time

This page was built for publication: