English

On ad hoc routing with guaranteed delivery

Distributed, Parallel, and Cluster Computing 2008-04-08 v1 Computational Complexity

Abstract

We point out a simple poly-time log-space routing algorithm in ad hoc networks with guaranteed delivery using universal exploration sequences.

Cite

@article{arxiv.0804.0862,
  title  = {On ad hoc routing with guaranteed delivery},
  author = {Mark Braverman},
  journal= {arXiv preprint arXiv:0804.0862},
  year   = {2008}
}
R2 v1 2026-06-21T10:28:00.312Z