Memoryless search algorithms in a network with faulty advice

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 206-216

  Hanusse, Nicolas ^a   Kavvadias, Dimitris ^b   Kranakis, Evangelos ^c   Krizanc, Danny ^d  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF PATRAS   (Greece)

^c CARLETON UNIVERSITY   (Canada)

^d WESLEYAN UNIVERSITY   (United States)

Author keywords

Data structure and algorithms; Distributed computing; Faulty networks; Graph; Random walks; Randomized algorithms

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; GRAPH THEORY; MOBILE AGENTS; QUERY LANGUAGES; QUERY PROCESSING;

COMPLETE GRAPHS; GRAPH; PRIOR KNOWLEDGE; RANDOM WALK; RANDOMIZED ALGORITHMS; SEARCH ALGORITHMS; SHORTEST PATH; SPIDER GRAPHS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33645140788     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_18     Document Type: Article

References (12)

1. Y. Azar, A. Broder, A. Karlin, N. Liniał, and S. Phillips. Biased random walks. Combinatorics 16:1-18, 1996.
2. D.J. Aldous and J.A. Fill. Reversible markov chains and random walks on graphs, (book in preparation, available on the web from http://www.stat.berkeley.edu/users/aldous/book.html).
3. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences and the complexity of maze problems. In Proc. 20th FOCS, pages 218-223, 1979.
4. A Broder, A. K. Karlin, P. Raghavan, and E. Upfal. Trading space for time in undirected s-1 connedtivity. In Proc. STOC, pages 543-549, 1989.
5. R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 1993.
6. N. Hanusse, E. Kranakis, and K. Krizanc. Searching with mobile agents in networks with liars. In Proc. EUROPAR'2000, LNCS 1900, pages 583-590, Munich, 2000.
7. E. Kranakis and D. Krizanc. Searching with uncertainty. In Proc. SIROCCO'99, Carleton Scientific, pages 194-203, 1999.
8. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou. Locating information with uncertainty in fully interconnected networks. In Proc. DISC2000, LNCS 1914, pages 283-296, Toledo, Spain, 2000.
9. R. Karlin and P. Raghavan. Random walks and undirected graph connectivity: A survey. In Discrete Probability and Algorithms, Institute of Mathematics and its Applications, Vol., 72, Springer Verlag, 1995, pages 95-101, 1995.
10. N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou. The complexity of searching a graph. Journal of the ACM, 1988.
11. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
12. J.R. Norris. Markov Chains. Cambridge University Press, 1997.