Labeling schemes for weighted dynamic trees
From MaRDI portal
Publication:2464140
DOI10.1016/j.ic.2007.08.004zbMath1132.68046OpenAlexW2014912500MaRDI QIDQ2464140
Publication date: 10 December 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2007.08.004
Related Items (5)
Near-optimal induced universal graphs for cycles and paths ⋮ Compact routing messages in self-healing trees ⋮ Implicit representation of relations ⋮ New bounds for the controller problem ⋮ A note on models for graph representations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Labeling schemes for dynamic tree networks
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- Graphs with small bandwidth and cutwidth
- Approximating the bandwidth via volume respecting embeddings
- Distance labeling schemes for well-separated graph classes
- An unexpected result in coding the vertices of a graph
- Informative labeling schemes for graphs
- Measured descent: A new embedding method for finite metrics
- Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
- The bandwidth problem for graphs and matrices—a survey
- Implicat Representation of Graphs
- Local management of a global resource in a communication network
- Distributed Computing: A Locality-Sensitive Approach
- Labeling Schemes for Flow and Connectivity
- Distance labeling in graphs
- Compact and localized distributed data structures
- Distributed Computing
- Compact oracles for reachability and approximate distances in planar digraphs
- Constructing Labeling Schemes Through Universal Matrices
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Coding the vertexes of a graph
- Algorithms and Computation
This page was built for publication: Labeling schemes for weighted dynamic trees
