scientific article; zbMATH DE number 1756017
From MaRDI portal
Publication:4535803
zbMath0987.68001MaRDI QIDQ4535803
Pierre Fraigniaud, Cyril Gavoille
Publication date: 16 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (43)
A Simple and Optimal Ancestry Labeling Scheme for Trees ⋮ Name-independent compact routing in trees ⋮ Collective tree spanners in graphs with bounded parameters ⋮ Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs ⋮ Routing among convex polygonal obstacles in the plane ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ Routing in polygonal domains ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Compact routing messages in self-healing trees ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Compact and low delay routing labeling scheme for unit disk graphs ⋮ Unnamed Item ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Distributed computing of efficient routing schemes in generalized chordal graphs ⋮ General compact labeling schemes for dynamic trees ⋮ Distributed verification of minimum spanning trees ⋮ Compact and localized distributed data structures ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Distributed Relationship Schemes for Trees ⋮ How much memory is needed for leader election ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ Labeling schemes for weighted dynamic trees ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Routing in unit disk graphs ⋮ Compact Routing in Unit Disk Graphs ⋮ Compact roundtrip routing with topology-independent node names ⋮ Max-stretch reduction for tree spanners ⋮ Randomized proof-labeling schemes ⋮ Distance labeling schemes for well-separated graph classes ⋮ Constructing labeling schemes through universal matrices ⋮ Unnamed Item ⋮ On compact and efficient routing in certain graph classes ⋮ Close to linear space routing schemes ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs ⋮ A note on models for graph representations ⋮ Labeling schemes for tree representation ⋮ Compact policy routing ⋮ On Approximate Distance Labels and Routing Schemes with Affine Stretch ⋮ Short Labels by Traversal and Jumping ⋮ Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Routing in Polygonal Domains
This page was built for publication:
