Route discovery with constant memory in oriented planar geometric networks

DOI10.1002/net.20114zbMath1097.68507OpenAlexW4249052652MaRDI QIDQ5487818

No author found.

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://ir.library.carleton.ca/pub/2881

zbMATH Keywords

Eulerian networkface routingconstant memory routingoriented planar network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Bounding the locality of distributed routing algorithms ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

Cites Work

• Geometric ad-hoc routing
• Unnamed Item

This page was built for publication: Route discovery with constant memory in oriented planar geometric networks