Representing graphs implicitly using almost optimal space
From MaRDI portal
Publication:5928875
DOI10.1016/S0166-218X(00)00225-0zbMath0991.05092WikidataQ59256035 ScholiaQ59256035MaRDI QIDQ5928875
Publication date: 24 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (5)
Trading uninitialized space for time ⋮ On the OBDD representation of some graph classes ⋮ Succinct posets ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ On the OBDD size for graphs of bounded tree- and clique-width
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- On the succinct representation of graphs
- Designing networks with compact routing tables
- Implicit data structures for linear hashing schemes
- Implicit data structures for fast search and update
- Representation of graphs
- Parallel concepts in graph theory
- Algorithms for parallel memory, I: Two-level memories
- A data structure for lattice representation
- Distributed algorithms. 10th international workshop, WDAG '96, Bologna, Italy, October 9--11, 1996. Proceedings
- An unexpected result in coding the vertices of a graph
- The complexity of searching implicit graphs
- Memory requirement for routing in distributed networks
- Optimal routing tables
- Labelling and Implicit Routing in Networks
- Succinct representations of graphs
- Space-Efficient Message Routing inc-Decomposable Networks
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Interval Routing
- Efficient Message Routing in Planar Networks
- Implicit Data Structures for the Dictionary Problem
- Implicat Representation of Graphs
- Implicit $O(1)$ Probe Search
- An Efficient Data Structure for Lattice Operations
- A trade-off between space and efficiency for routing tables
- A note on succinct representations of graphs
- What Can be Computed Locally?
- Coding the vertexes of a graph
This page was built for publication: Representing graphs implicitly using almost optimal space
