Memoryless search algorithms in a network with faulty advice

DOI10.1016/j.tcs.2008.04.034zbMath1146.68015OpenAlexW1977603728MaRDI QIDQ935471

Danny Krizanc, Nicolas Hanusse, Evangelos Kranakis, Dimitris J. Kavvadias

Publication date: 6 August 2008

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

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

zbMATH Keywords

random walksdistributed computingrandomized algorithmsgraph searchingfaulty networksmobile agent computing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (4)

The impact of dynamic events on the number of errors in networks ⋮ Unnamed Item ⋮ Querying with Uncertainty ⋮ Searching a Tree with Permanently Noisy Advice

Cites Work

• Searching with mobile agents in networks with liars.
• Biased random walks
• Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval
• Markov Chains
• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory

This page was built for publication: Memoryless search algorithms in a network with faulty advice