Compact and localized distributed data structures
From MaRDI portal
Publication:5138487
DOI10.1007/S00446-002-0073-5zbMATH Open1448.68225OpenAlexW2020965855MaRDI QIDQ5138487FDOQ5138487
Authors: Cyril Gavoille, David Peleg 
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
Recommendations
Cites Work
- Graph Classes: A Survey
- Depth-First Search and Linear Graph Algorithms
- Preserving order in a forest in less than logarithmic time and linear space
- A partial k-arboretum of graphs with bounded treewidth
- Upper bounds to the clique width of graphs
- Distributed Computing: A Locality-Sensitive Approach
- On Maintaining Dynamic Information in a Concurrent Environment
- Title not available (Why is that?)
- Graph spanners
- Designing networks with compact routing tables
- Distributed match-making
- Fast Algorithms for Finding Nearest Common Ancestors
- Space-Efficient Message Routing inc-Decomposable Networks
- Interval Routing
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Efficient Message Routing in Planar Networks
- Implicat Representation of Graphs
- Compact routing with minimum stretch
- Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
- An unexpected result in coding the vertices of a graph
- Distance labeling in graphs (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal clustering structures for hierarchical topological design of large computer networks
- A survey on interval routing
- The compactness of interval routing for almost all graphs
- Memory requirement for routing in distributed networks
- Labelling and Implicit Routing in Networks
- Interval Routing onk-Trees
- A trade-off between space and efficiency for routing tables
- Space-efficiency for routing schemes of stretch factor three
- Approximate distance oracles
- Interval routing schemes
- Routing with Polynomial Communication-Space Trade-Off
- Compact routing schemes with low stretch factor
- Concurrency of operations on B-trees
- Concurrent manipulation of binary search trees
- Title not available (Why is that?)
- Concurrent search and insertion in 2-3 trees
- Query efficient implementation of graphs of bounded clique-width
- Prefix routing schemes in dynamic networks
- Concurrent Search and Insertion in AVL Trees
- Memory requirement for universal routing schemes
- Multidimensional interval routing schemes
- Partial characterizations of networks supporting shortest path interval labeling schemes
- Interval routing schemes
- Introduction to the theory of nested transactions
- Title not available (Why is that?)
- Coding the vertexes of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Worst Case Bounds for Shortest Path Interval Routing
- Title not available (Why is that?)
- Interval routing schemes allow broadcasting with linear message-complexity
- Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sparse communication networks and efficient routing in the plane (extended abstract)
- Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
- The complexity of shortest path and dilation bounded interval routing
- The complexity of the characterization of networks supporting shortest-path interval routing.
- The Complexity of Interval Routing on Random Graphs
- On Multi-Label Linear Interval Routing Schemes
- On devising Boolean Routing Schemes
- On the complexity of multi-dimensional interval routing schemes
- Title not available (Why is that?)
- Lower bounds for compact routing (extended abstract)
- Compact roundtrip routing in directed networks (extended abstract)
- Searching among intervals and compact routing tables
Cited In (25)
- Localized and compact data-structure for comparability graphs
- Short Labels by Traversal and Jumping
- Adjacency labeling schemes and induced-universal graphs
- Graph searching with advice
- Labeling schemes for weighted dynamic trees
- Distributed Data Structures: A Survey on Informative Labeling Schemes
- Distributed distance computation and routing with small messages
- Title not available (Why is that?)
- Efficient First-Order Model-Checking Using Short Labels
- Implicit representation of relations
- Embedded minimal disks: Proper versus nonproper—global versus local
- Near-optimal induced universal graphs for cycles and paths
- Average case analysis for tree labelling schemes
- Shorter Labeling Schemes for Planar Graphs
- Title not available (Why is that?)
- Connectivity check in 3-connected planar graphs with obstacles
- Distance Labeling for Permutation Graphs
- On efficient distributed construction of near optimal routing schemes
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Distance labeling schemes for well-separated graph classes
- A dynamic distributed approach to representing proper interval graphs
- Structural Information and Communication Complexity
- Bypassing Erdős' girth conjecture: hybrid stretch and sourcewise spanners
- Distributed Relationship Schemes for Trees
- Proof labeling schemes for reachability-related problems in directed graphs
This page was built for publication: Compact and localized distributed data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138487)
