The following pages link to (Q4796196):
Displayed 31 items.
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Tree-length equals branch-length (Q1044006) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Interval routing in reliability networks (Q1770375) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Average case analysis for tree labelling schemes (Q2371804) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- (Q6065428) (← links)