Succinct representations of graphs
Information and Control
A note on succinct representations of graphs
Information and Control
Handbook of theoretical computer science (vol. A)
An efficient representation for sparse sets
ACM Letters on Programming Languages and Systems (LOPLAS)
A versatile data structure for edge-oriented graph algorithms
Communications of the ACM
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Representing graphs implicitly using almost optimal space
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Graph Problems fore Succinctly Represented Graphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient method to perform isomorphism testing of labeled graphs
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
| Hi-index | 0.89 |
The design of efficient graph algorithms usually precludes the test of edge existence, because an efficient support of that operation already requires time Ω(n2) for the initialization of an adjacency-matrix representation. We describe an alternative representation of static directed graphs taking Θ(n+m) initialization time and using Θ(n2) space, which supports the efficient implementation of all usual operations on static graphs. The sparse graph representation allows the design of efficient graph algorithms using both iteration over all vertices adjacent with a given vertex and edge-existence operations, although at the expense of additional (uninitialized) space which may, nevertheless, be used for other purposes. To the best of our knowledge, the representation leads to the first graph algorithms with the disconcerting property that the time complexity is better than the space complexity.