A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
2014
ACM Transactions on Algorithms
We obtain several improved solutions for the deterministic rendezvous problem in general undirected graphs. Our solutions answer several problems left open by Dessmark et al. We also introduce an interesting variant of the rendezvous problem which we call the deterministic treasure hunt problem. Both the rendezvous and the treasure hunt problems motivate the study of universal traversal sequences and universal exploration sequences with some strengthened properties. We call such sequences
doi:10.1145/2601068
fatcat:tgbozfx5jfethiaqvl7faeooqi