Compact and low delay routing labeling scheme for Unit Disk Graphs
- 31 August 2012
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 45 (7) , 305-325
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Spanners for Geometric Intersection GraphsLecture Notes in Computer Science, 2007
- Collective Tree Spanners and Routing in AT-free Related GraphsJournal of Graph Algorithms and Applications, 2006
- Collective tree spanners of graphsSIAM Journal on Discrete Mathematics, 2006
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphsJournal of Algorithms, 2004
- Well-separated pair decomposition for the unit-disk graph metric and its applications2003
- Geometric spanners for wireless ad hoc networksIEEE Transactions on Parallel and Distributed Systems, 2003
- Traveling with a Pez dispenser (or, routing issues in MPLS)2001
- Geometric spanner for routing in mobile networks2001
- Classes of graphs which approximate the complete euclidean graphDiscrete & Computational Geometry, 1992
- Unit disk graphsDiscrete Mathematics, 1990