Faster Treasure Hunt and Better Strongly Universal Exploration Sequences

DOI10.1007/978-3-540-77120-3_48zbMath1193.68200arXiv1204.5442OpenAlexW1756362187MaRDI QIDQ5387786

Qin Xin

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.5442

zbMATH Keywords

networksrendezvousdistributed computingdesign and analysis of algorithmsstrongly universal exploration sequences

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences

Cites Work

• Unnamed Item
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Collisions Among Random Walks on a Graph
• Undirected ST-connectivity in log-space
• How to Meet in Anonymous Network
• Algorithms and Computation
• Algorithms - ESA 2003

This page was built for publication: Faster Treasure Hunt and Better Strongly Universal Exploration Sequences