Searching among intervals and compact routing tables
From MaRDI portal
Publication:4630246
DOI10.1007/3-540-56939-1_59zbMath1418.68073OpenAlexW1541820931MaRDI QIDQ4630246
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56939-1_59
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (4)
On the computation of fast data transmissions in networks with capacities and delays ⋮ Interval routing schemes allow broadcasting with linear message-complexity ⋮ Compact and localized distributed data structures ⋮ Shortest path queries in digraphs of small treewidth
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Designing networks with compact routing tables
- Implicit data structures for fast search and update
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Storing a sparse table
- Labelling and Implicit Routing in Networks
- Shortest-path algorithms: Taxonomy and annotation
- Implicit data structures for weighted elements
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Should Tables Be Sorted?
- Implicit Data Structures for the Dictionary Problem
- New Bounds on the Complexity of the Shortest Path Problem
- Design and implementation of an efficient priority queue
- Planar graph decomposition and all pairs shortest paths
- Fibonacci heaps and their uses in improved network optimization algorithms
- A Theorem on Boolean Matrices
This page was built for publication: Searching among intervals and compact routing tables