Compact representations of separable graphs

14 years 12 months ago

Download www.cs.cmu.edu

We consider the problem of representing graphs compactly while supporting queries eﬃciently. In particular we describe a data structure for representing n-vertex unlabeled graphs that satisfy an O(nc )-separator the

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

Real-time Traffic

Algorithms | N-vertex Unlabeled Graphs | SODA 2003 |

claim paper

» Flow trees for vertexcapacitated networks

» Small InducedUniversal Graphs and Compact Implicit Graph Representations

» Extended Compact Web Graph Representations

» A Fast and Compact Web Graph Representation

» k2Trees for Compact Web Graph Representation

» On Compact Representations of AllPairsShortestPathDistance Matrices

» Compact graph representations and parallel connectivity algorithms for massive dynamic net...

» Fast and Compact Web Graph Representations

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash

Comments (0)

Sciweavers

Compact representations of separable graphs

Algorithms | N-vertex Unlabeled Graphs | SODA 2003 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers