On ad hoc routing with guaranteed delivery

Simple item page
dc.creatorBraverman, Mark
dc.date2008-04-05
dc.date.accessioned2026-07-07T09:30:42Z
dc.date.available2026-07-07T09:30:42Z
dc.descriptionWe point out a simple poly-time log-space routing algorithm in ad hoc networks with guaranteed delivery using universal exploration sequences.
dc.identifierhttps://arxiv.org/abs/0804.0862
dc.identifierhttp://arxiv.org/abs/0804.0862
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158204
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectComputational Complexity
dc.subjectC.2.2; F.2.2
dc.titleOn ad hoc routing with guaranteed delivery
dc.typetext

Files

Collections

arXiv