Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs
- 24 December 2010
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 62 (3-4) , 713-732
Abstract
No abstract availableKeywords
This publication has 52 references indexed in Scilit:
- Localized and compact data-structure for comparability graphsDiscrete Mathematics, 2009
- Reconstructing approximate tree metrics2007
- Gromov hyperbolicity of Denjoy DomainsGeometriae Dedicata, 2006
- Routing in Networks with Low Doubling Dimension2006
- Object location using path separators2006
- Labeling Schemes for Small Distances in TreesSIAM Journal on Discrete Mathematics, 2005
- 1-Hyperbolic GraphsSIAM Journal on Discrete Mathematics, 2003
- A Note on Distance Approximating Trees in GraphsEuropean Journal of Combinatorics, 2000
- Metric Spaces of Non-Positive Curvature1999
- Distance Approximating Trees for Chordal and Dually Chordal GraphsJournal of Algorithms, 1999