scientific article; zbMATH DE number 1875437
From MaRDI portal
Scientific article; zbMATH DE number 1875437
Recommendations
Cited in
(48)- Universal augmentation schemes for network navigability
- Localized and compact data-structure for comparability graphs
- Tree-length equals branch-length
- Distance labeling scheme and split decomposition
- Sublinear-space distance labeling using hubs
- Distance labeling schemes for well-separated graph classes
- Interval routing in reliability networks
- A note on exact distance labeling
- Distance estimation and object location via rings of neighbors
- General compact labeling schemes for dynamic trees
- Distributed verification of minimum spanning trees
- Randomized proof-labeling schemes
- Distance labeling schemes for \(K_4\)-free bridged graphs
- Distance and routing labeling schemes for cube-free median graphs
- Tree-decompositions with bags of small diameter
- Average case analysis for tree labelling schemes
- How to use spanning trees to navigate in graphs
- Spanners for bounded tree-length graphs
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Labeling schemes for weighted dynamic trees
- Approximation algorithms for the metric labeling problem via a new linear programming formulation
- Approximate distance labeling schemes
- Metric dimension of bounded width graphs
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- On approximate distance labels and routing schemes with affine stretch
- Distance Labeling for Permutation Graphs
- Compact separator decompositions in dynamic trees and applications to labeling schemes
- Reachability and Distance Queries via 2-Hop Labels
- scientific article; zbMATH DE number 1500540 (Why is no real title available?)
- scientific article; zbMATH DE number 1759444 (Why is no real title available?)
- Simpler, faster and shorter labels for distances in graphs
- Sublinear Distance Labeling
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Distance labeling in graphs
- Proximity-preserving labeling schemes
- Forbidden-set distance labels for graphs of bounded doubling dimension
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
- Compact and localized distributed data structures
- Distance Labels with Optimal Local Stretch
- Forbidden-set distance labels for graphs of bounded doubling dimension
- Metric Dimension of Bounded Tree-length Graphs
- Inductive computations on graphs defined by clique-width expressions
- Algorithms and Computation
- Fault-tolerant distance labeling for planar graphs
- Fault-tolerant distance labeling for planar graphs
- scientific article; zbMATH DE number 7765385 (Why is no real title available?)
- Constructing labeling schemes through universal matrices
- On compact and efficient routing in certain graph classes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796196)
