Compact and localized distributed data structures
From MaRDI portal
Publication:5138487
DOI10.1007/s00446-002-0073-5zbMath1448.68225OpenAlexW2020965855MaRDI QIDQ5138487
Publication date: 4 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-002-0073-5
Related Items (max. 100)
Node labels in local decision ⋮ Average case analysis for tree labelling schemes ⋮ Connectivity check in 3-connected planar graphs with obstacles ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Distributed distance computation and routing with small messages ⋮ Efficient First-Order Model-Checking Using Short Labels ⋮ Implicit representation of relations ⋮ Distributed Relationship Schemes for Trees ⋮ Labeling schemes for weighted dynamic trees ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Sparse covers for planar graphs and graphs that exclude a fixed minor ⋮ Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners ⋮ Distance labeling schemes for well-separated graph classes ⋮ Graph searching with advice ⋮ Localized and compact data-structure for comparability graphs ⋮ Short Labels by Traversal and Jumping ⋮ A dynamic distributed approach to representing proper interval graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Proof labeling schemes for reachability-related problems in directed graphs ⋮ Distance Labeling for Permutation Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concurrent search and insertion in 2-3 trees
- Designing networks with compact routing tables
- Distributed match-making
- Introduction to the theory of nested transactions
- Concurrency of operations on B-trees
- Preserving order in a forest in less than logarithmic time and linear space
- A partial k-arboretum of graphs with bounded treewidth
- Multidimensional interval routing schemes
- On devising Boolean Routing Schemes
- Query efficient implementation of graphs of bounded clique-width
- The complexity of shortest path and dilation bounded interval routing
- A survey on interval routing
- On the complexity of multi-dimensional interval routing schemes
- The complexity of the characterization of networks supporting shortest-path interval routing.
- Upper bounds to the clique width of graphs
- An unexpected result in coding the vertices of a graph
- Compact Routing with Minimum Stretch
- The Compactness of Interval Routing for Almost All Graphs
- Memory requirement for routing in distributed networks
- Labelling and Implicit Routing in Networks
- Fast Algorithms for Finding Nearest Common Ancestors
- Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
- Space-Efficient Message Routing inc-Decomposable Networks
- On Maintaining Dynamic Information in a Concurrent Environment
- Interval Routing
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Graph spanners
- Efficient Message Routing in Planar Networks
- The Complexity of Interval Routing on Random Graphs
- Concurrent manipulation of binary search trees
- Concurrent Search and Insertion in AVL Trees
- Optimal clustering structures for hierarchical topological design of large computer networks
- Routing with Polynomial Communication-Space Trade-Off
- Implicat Representation of Graphs
- Worst Case Bounds for Shortest Path Interval Routing
- Graph Classes: A Survey
- Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
- Prefix routing schemes in dynamic networks
- Interval Routing onk-Trees
- Distributed Computing: A Locality-Sensitive Approach
- Partial characterizations of networks supporting shortest path interval labeling schemes
- Lower bounds for compact routing
- Searching among intervals and compact routing tables
- A trade-off between space and efficiency for routing tables
- Compact routing schemes with low stretch factor
- On Multi-Label Linear Interval Routing Schemes
- Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
- Interval routing schemes allow broadcasting with linear message-complexity
- Approximate distance oracles
- Sparse communication networks and efficient routing in the plane (extended abstract)
- Compact roundtrip routing in directed networks (extended abstract)
- Memory requirement for universal routing schemes
- Coding the vertexes of a graph
- Depth-First Search and Linear Graph Algorithms
- Interval routing schemes
- Interval routing schemes
- Space-efficiency for routing schemes of stretch factor three
This page was built for publication: Compact and localized distributed data structures
