Efficiently searching a graph by a smell-oriented vertex process
From MaRDI portal
Publication:1286410
DOI10.1023/A:1018957401093zbMath0930.68052OpenAlexW1516427227MaRDI QIDQ1286410
Michael Lindenbaum, Israel A. Wagner, Alfred Marcel Bruckstein
Publication date: 16 February 2000
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018957401093
Related Items (6)
A distributed ant algorithm for efficiently patrolling a network ⋮ The robot crawler graph process ⋮ The Range of a Rotor Walk ⋮ Ant colony search algorithms for optimal polygonal approximation of plane curves. ⋮ Static and expanding grid coverage with ant robots: complexity results ⋮ Multi-robot area patrol under frequency constraints
Uses Software
This page was built for publication: Efficiently searching a graph by a smell-oriented vertex process