Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

DOI10.1007/978-3-642-03367-4_49zbMath1252.05214OpenAlexW1587375058MaRDI QIDQ3183486

Chenyu Yan, Feodor F. Dragan, Yang Xiang

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 labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Compact and low delay routing labeling scheme for unit disk graphs

Cites Work

• Unnamed Item
• Unit disk graphs
• Geometric ad-hoc routing
• Well-separated pair decomposition for the unit-disk graph metric and its applications
• Spanners for Geometric Intersection Graphs
• A Separator Theorem for Planar Graphs
• Distributed Computing: A Locality-Sensitive Approach
• Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
• Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
• Collective Tree Spanners and Routing in AT-free Related Graphs
• Collective tree spanners of graphs

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