Euclidean Greedy Drawings of Trees

Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of greedy embedd...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Nöllenburg, Martin, Prutkin, Roman
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Geometry
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!