Succinct representation of general unlabeled graphs
Discrete Applied Mathematics
Short encodings of planar graphs and maps
Discrete Applied Mathematics
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
The ISPD98 circuit benchmark suite
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
SIAM Journal on Discrete Mathematics
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
SIAM Journal on Computing
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Succinct representation of balanced parentheses, static trees and planar graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Index Compression through Document Reordering
DCC '02 Proceedings of the Data Compression Conference
Towards Compressing Web Graphs
DCC '01 Proceedings of the Data Compression Conference
Compressing the Graph Structure of the Web
DCC '01 Proceedings of the Data Compression Conference
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
Graph compression and the zeros of polynomials
Information Processing Letters
Dictionaries using variable-length keys and data, with applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
Optimal succinct representations of planar maps
Proceedings of the twenty-second annual symposium on Computational geometry
Efficient query processing on unstructured tetrahedral meshes
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Accelerating sparse matrix computations via data compression
Proceedings of the 20th annual international conference on Supercomputing
Visualization of large networks with min-cut plots, A-plots and R-MAT
International Journal of Human-Computer Studies
Compact dictionaries for variable-length keys and data with applications
ACM Transactions on Algorithms (TALG)
Efficient aggregation for graph summarization
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Quick encoding of plane graphs in log 214 bits per edge
Information Processing Letters
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Efficient Compression of Web Graphs
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Succinct Representations of Arbitrary Graphs
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Succinct representations of planar maps
Theoretical Computer Science
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry
A geometric preferential attachment model of networks II
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
A fast and compact web graph representation
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
Succinct representations of separable graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
On summarizing graph homogeneously
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Compact navigation and distance oracles for graphs with small treewidth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Succinct representation of triangulations with a boundary
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Explicit array-based compact data structures for triangulations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Non-linear compression: Gzip Me Not!
HotStorage'12 Proceedings of the 4th USENIX conference on Hot Topics in Storage and File Systems
Some typical properties of the spatial preferred attachment model
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
GraphChi: large-scale graph computation on just a PC
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Breaking the speed and scalability barriers for graph exploration on distributed-memory machines
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Succinct encoding of arbitrary graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graphs that satisfy an O(nc)-separator theorem, c O(n) bits, and supports adjacency and degree queries in constant time, and neighbor listing in constant time per neighbor. This generalizes previous results for graphs with constant genus, such as planar graphs.We present experimental results using many "real world" graphs including 3-dimensional finite element meshes, link graphs of the web, internet router graphs, VLSI circuits, and street map graphs. Compared to adjacency lists, our approach reduces space usage by almost an order of magnitude, while supporting depthfirst traversal in about the same running time.