Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

DOI10.1007/978-3-642-03367-4_49MaRDI QIDQ3183486zbMATH OpenOpenAlexFDO

Authors Chenyu Yan, Yang Xiang, Feodor F. Dragan

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_49

zbMATH Keywords

hop delayhop route-stretchlabel of destinationlabel of sourcerouting labeling schemeunit disk graph (UDG)

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Compact and low delay routing labeling scheme for unit disk graphs
• Collective tree spanners for unit disk graphs with applications
• Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes

Cites work

• scientific article; zbMATH DE number 1756017 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• Collective Tree Spanners and Routing in AT-free Related Graphs
• Collective tree spanners of graphs
• Distributed Computing: A Locality-Sensitive Approach
• Geometric ad-hoc routing, of theory and practice
• Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
• Spanners for Geometric Intersection Graphs
• Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
• Unit disk graphs
• Well-separated pair decomposition for the unit-disk graph metric and its applications

Cited in

(1)

• Compact and low delay routing labeling scheme for unit disk graphs

This page was built for publication: Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183486)