scientific article
From MaRDI portal
Publication:2768294
zbMath0987.05083MaRDI QIDQ2768294
Cyril Gavoille, Stéphane Pérennes, Ran Raz, David Peleg
Publication date: 14 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Average case analysis for tree labelling schemes ⋮ Small Stretch Pairwise Spanners and Approximate $D$-Preservers ⋮ Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms ⋮ Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas ⋮ Threshold-coloring and unit-cube contact representation of planar graphs ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Prioritized Metric Structures and Embedding ⋮ Distributed distance computation and routing with small messages ⋮ New pairwise spanners ⋮ Query efficient implementation of graphs of bounded clique-width ⋮ Distributed verification of minimum spanning trees ⋮ Distance labeling scheme and split decomposition ⋮ Unnamed Item ⋮ Compact and localized distributed data structures ⋮ Temporal network optimization subject to connectivity constraints ⋮ Distance labeling schemes for well-separated graph classes ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Communication algorithms with advice ⋮ Constructing labeling schemes through universal matrices ⋮ On distance constrained labeling of disk graphs ⋮ Interval routing in reliability networks ⋮ A note on labeling schemes for graph connectivity ⋮ Informative labeling schemes for graphs ⋮ List graphs and distance-consistent node labelings ⋮ ReHub
This page was built for publication:
