Constant memory routing in quasi-planar and quasi-polyhedral graphs

DOI10.1016/j.dam.2008.01.027zbMath1155.90469OpenAlexW2061436084MaRDI QIDQ1003732

Evangelos Kranakis, Ladislav Stacho, Tim Mott

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.027

zbMATH Keywords

planar graphroutingad hoc networklocal algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Geometric ad-hoc routing
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• Algorithmic Aspects of Wireless Sensor Networks
• Structural Information and Communication Complexity
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: Constant memory routing in quasi-planar and quasi-polyhedral graphs