Searching with mobile agents in networks with liars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1900, Issue , 2000, Pages 583-590

  Hanusse, Nicolas ^a   Kranakis, Evangelos ^a   Krizanc, Danny ^b  

^a CARLETON UNIVERSITY   (Canada)

^b WESLEYAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; QUERY PROCESSING; TREES (MATHEMATICS);

BOUNDED DEGREE TREES; COMPLETE GRAPHS; HYPERCUBE; IN NETWORKS; PRIOR KNOWLEDGE; SHORTEST PATH;

MOBILE AGENTS;

EID: 0346478918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44520-x_80     Document Type: Conference Paper

References (16)

1. Y. Afek, E. Gafni, and M. Ricklin, Upper and lower bounds for routing schemes in dynamic networks, in: Proc. 30th Symposium on Foundations of Computer Science, (1989), 370–375.
2. S. Albers and M. Henzinger, Exploring unknown environments, in Proc. 29th Symposium on Theory of Computing, (1999), 416–425.
3. B. Awerbuch, B. Patt-Shamir, and G. Varghese, Self-stabilizing end-to-end communication, Journal of High Speed Networks 5 (1996), 365–381.
4. R.A. Baeza-Yates, J.C. Culberson and G.J.E Rawlins, Searching in the plane, Information and Computation 106(2) (1993), 234–252.
5. D. Bienstock and P. Seymour, Monotonicity in graph searching, Journal of Algorithms 12 (1991), 239–245.
6. P.J. Cameron. Topics, Techniques, Algorithms. Cambridge University Press, 1994.
7. R. Cole, B. Maggs and R. Sitaraman, Routing on butterfly networks with random faults, in: Proc. 36th Symposium on Foundations of Computer Science, (1995), 558–570.
8. S. Dolev, E. Kranakis, D. Krizanc and D. Peleg, Bubbles: Adaptive routing scheme for high-speed networks, SIAM Journal on Computing, to appear.
9. E. Kranakis and D Krizanc, Searching with uncertainty, in: Proc. 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO), (1999), C. Gavoille, J.-C, Bermond, and A. Raspaud, eds., pp, 194-203, Carleton Scientific, 1999.
10. L.M. Kirousis, E. Kranakis, D. Krizanc, and Y.C. Stamatiou. Locating information with uncertainty in fully interconnected networks. unpublished paper, (1999).
11. E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in Proc. 9th Symposium on Discrete Algorithms, 1998, 236–243.
12. L. Kirousis and C. Papadimitriou, Interval graphs and searching, Discrete Mathematics 55 (1985), 181–184.
13. N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou, The complexity of searching a graph, Journal of the ACM 35 (1988), 18–44.
14. T. Leighton and B. Maggs, Expanders might be practical, in: 30th Proc. Symposium on Foundations of Computer Science, (1989), 384–389.
15. P. Panaite and A. Pelc, Exploring unknown undirected graphs, in: Proc. 9th Symposium on Discrete Algorithms, (1998), 316–322.
16. Mobile Agents, W. R. Cockayne and M. Zyda, editors, Manning Publications Co., Greenwitch, Connecticut, 1997. http://www.manning.com/Cockayne/Contents.html