Searching among intervals and compact routing tables
type: Item
instance of: scholarly article
title: Searching among intervals and compact routing tables
zbMATH Open document ID: 0846.68025
DOI: 10.1007/BF01955044
author: Greg N. Frederickson
published in: Algorithmica
publication date: 1996-05-27T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 881760
zbMATH Keywords: predecessor finding
zbMATH Keywords: succinct encoding
zbMATH Keywords: shortest paths
zbMATH Keywords: weighted directed graphs
zbMATH Keywords: compact routing tables
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q3619797
cites work: Shortest-path algorithms: Taxonomy and annotation
cites work: A note on two problems in connexion with graphs
cites work: Q4036575
cites work: Implicit Data Structures for the Dictionary Problem
cites work: Implicit data structures for weighted elements
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Planar graph decomposition and all pairs shortest paths
cites work: Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems
cites work: Designing networks with compact routing tables
cites work: New Bounds on the Complexity of the Shortest Path Problem
cites work: Q5572939
cites work: Implicit data structures for fast search and update
cites work: Labelling and Implicit Routing in Networks
cites work: Storing a sparse table
cites work: Design and implementation of an efficient priority queue
cites work: Q3711761
cites work: A Theorem on Boolean Matrices
cites work: Log-logarithmic worst-case range queries are possible in space theta(N)
cites work: Should Tables Be Sorted?
full work available at URL: https://doi.org/10.1007/bf01955044
OpenAlex ID: W2077996575
Recommended article: Searching among intervals and compact routing tables
Recommended article: The Compactness of Interval Routing
Recommended article: On interval routing schemes and treewidth
Recommended article: Q3815249
Recommended article: The compactness of interval routing for almost all graphs
Recommended article: On the complexity of multi-dimensional interval routing schemes
Recommended article: Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
Recommended article: Q4536937
Recommended article: The complexity of shortest path and dilation bounded interval routing
Recommended article: The compactness of adaptive routing tables
description: scientific article; zbMATH DE number 881760