Algorithmic Aspects of Wireless Sensor Networks

DOI10.1007/B98740zbMATH Open1104.68328OpenAlexW2489302366MaRDI QIDQ5312960FDOQ5312960

Authors: David Ratajczak, Christos Papadimitriou 

Publication date: 25 August 2005

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

Full work available at URL: https://doi.org/10.1007/b98740

Recommendations

• On a conjecture related to geometric routing
• Some results on greedy embeddings in metric spaces
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• On succinct convex greedy drawing of 3-connected plane graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cited In (10)

• On planar greedy drawings of 3-connected planar graphs
• Distributed computation of virtual coordinates for greedy routing in sensor networks
• Structural Information and Communication Complexity
• Greedy rectilinear drawings
• Some results on greedy embeddings in metric spaces
• Every Schnyder drawing is a greedy embedding
• On a conjecture related to geometric routing
• Geometric approach for optimal routing on a mesh with buses
• On the extremal structure of an OSPF related cone
• On the area requirements of planar greedy drawings of triconnected planar graphs

This page was built for publication: Algorithmic Aspects of Wireless Sensor Networks

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