scientific article; zbMATH DE number 1875437
From MaRDI portal
Publication:4796196
zbMath1006.68542MaRDI QIDQ4796196
Christophe Paul, Cyril Gavoille, Michal Katz, Nir A. Katz, David Peleg
Publication date: 2 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610476
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Approximation algorithms (68W25)
Related Items (31)
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 ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ Inductive computations on graphs defined by clique-width expressions ⋮ Metric Dimension of Bounded Width Graphs ⋮ Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ 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 ⋮ Distance labeling scheme and split decomposition ⋮ Unnamed Item ⋮ An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs ⋮ Compact and localized distributed data structures ⋮ Labeling schemes for weighted dynamic trees ⋮ Randomized proof-labeling schemes ⋮ Constructing labeling schemes through universal matrices ⋮ Interval routing in reliability networks ⋮ On compact and efficient routing in certain graph classes ⋮ Fault-tolerant distance labeling for planar graphs ⋮ An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs ⋮ Universal augmentation schemes for network navigability ⋮ Localized and compact data-structure for comparability graphs ⋮ Tree-length equals branch-length ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs ⋮ Distance Labeling for Permutation Graphs ⋮ Metric Dimension of Bounded Tree-length Graphs
This page was built for publication:
