Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Introduction to algorithms
Handbook of theoretical computer science (vol. A)
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Efficient computation of implicit representations of sparse graphs
Discrete Applied Mathematics
Simple planar graph partition into three forests
Discrete Applied Mathematics
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Compact Implicit Representation of Graphs
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in 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
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A dynamic implicit adjacency labelling scheme for line graphs
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Graph orientations optimizing the number of light or heavy vertices
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Simple deterministic algorithms for fully dynamic maximal matching
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
A dynamic data structure for counting subgraphs in sparse graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present a linear space data structure for maintaining graphs with bounded arboricity--a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth--under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity.