scientific article; zbMATH DE number 1756017
From MaRDI portal
Publication:4535803
Recommendations
Cited in
(53)- Semi-preemptive routing on trees
- A note on models for graph representations
- Labeling schemes for tree representation
- Compact routing messages in self-healing trees
- Distance labeling schemes for well-separated graph classes
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- General compact labeling schemes for dynamic trees
- Distributed verification of minimum spanning trees
- Randomized proof-labeling schemes
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Near-optimal induced universal graphs for cycles and paths
- Distance and routing labeling schemes for cube-free median graphs
- Navigation in tree spaces
- Name-independent compact routing in trees
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Labeling schemes for weighted dynamic trees
- Max-stretch reduction for tree spanners
- scientific article; zbMATH DE number 1670868 (Why is no real title available?)
- On approximate distance labels and routing schemes with affine stretch
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
- Routeing on trees
- Distributed computing of efficient routing schemes in generalized chordal graphs
- A simple and optimal ancestry labeling scheme for trees
- Compact separator decompositions in dynamic trees and applications to labeling schemes
- scientific article; zbMATH DE number 3940741 (Why is no real title available?)
- Compact and low delay routing labeling scheme for unit disk graphs
- Distributed computing of efficient routing schemes in generalized chordal graphs
- Adjacency labeling schemes and induced-universal graphs
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Compact oblivious routing
- Routing in polygonal domains
- Compact and localized distributed data structures
- Near-optimal distributed routing with low memory
- Distributed Routing in Tree Networks with Few Landmarks
- Distributed Relationship Schemes for Trees
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Shorter Labeling Schemes for Planar Graphs
- Compact oblivious routing in weighted graphs
- Short Labels by Traversal and Jumping
- Compact roundtrip routing with topology-independent node names
- Compact policy routing
- Close to linear space routing schemes
- Compact Routing in Unit Disk Graphs
- Routing among convex polygonal obstacles in the plane
- How much memory is needed for leader election
- Routing on trees
- Optimal Euclidean tree covers
- Routing among convex polygonal obstacles in the plane using a simplified domain
- Optimal distance labeling for permutation graphs
- Collective tree spanners in graphs with bounded parameters
- 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 Q4535803)
