Exploration of a finite graph by a collective of agents

MaRDI QIDQ2901730zbMATH OpenFDO

Authors A. Stepkin, I. S. Grunskij

Publication date 31 July 2012

Published in Trudy Instituta Prikladnoĭ Matematiki i Mekhaniki (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Using a collective of agents for exploration of undirected graphs
• Exploration of dynamic networks: tight bounds on the number of agents
• Structural Information and Communication Complexity
• Tight bounds for undirected graph exploration with pebbles and multiple agents
• Graph theoretic methods in multiagent networks
• Graph exploration by energy-sharing mobile agents
• Stochastic graph exploration
• Stochastic graph exploration with limited resources
• Map construction of unknown graphs by multiple agents

Cited in

(5)

• Reconstruction of a labeled graph by a graph-walking mobile agent
• Using a collective of agents for exploration of undirected graphs
• Structural Information and Communication Complexity
• A basic algorithm for graph reconstruction
• Explorable families of graphs

This page was built for publication: Exploration of a finite graph by a collective of agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901730)