Exploration of carrier-based time-varying networks: the power of waiting

DOI10.1016/j.tcs.2020.07.003zbMath1455.68141OpenAlexW3043510386MaRDI QIDQ2202018

Ahmed M. Wade, David Ilcinkas

Publication date: 17 September 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.003

zbMATH Keywords

mobile agentgraph explorationdynamic graphsC-graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Cites Work

• Efficient routing in carrier-based mobile networks
• Searching for black holes in subways
• Optimal graph exploration without good maps
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• On the exploration of time-varying networks
• Distributed exploration of dynamic rings
• Distributed computation in dynamic networks
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Undirected connectivity in log-space
• Crawling on Simple Models of Web Graphs
• Exploring Unknown Undirected Graphs

This page was built for publication: Exploration of carrier-based time-varying networks: the power of waiting