Searching with mobile agents in networks with liars.
From MaRDI portal
Publication:1422406
DOI10.1016/S0166-218X(03)00189-6zbMath1077.68095MaRDI QIDQ1422406
Danny Krizanc, Evangelos Kranakis, Nicolas Hanusse
Publication date: 14 February 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00189-6
90C35: Programming involving graphs or networks
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Searching a Tree with Permanently Noisy Advice, The impact of dynamic events on the number of errors in networks, Memoryless search algorithms in a network with faulty advice, Searching with mobile agents in networks with liars.
Cites Work
- Searching in the plane
- Interval graphs and searching
- Searching with mobile agents in networks with liars.
- The complexity of searching a graph
- Monotonicity in graph searching
- Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item