Searching with mobile agents in networks with liars

Discrete Applied Mathematics

Volumn 137, Issue 1, 2004, Pages 69-85

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

^a UNIVERSITÉ BORDEAUX 1   (France)

^b CARLETON UNIVERSITY   (Canada)

^c WESLEYAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DATABASE SYSTEMS; NETWORK PROTOCOLS; ONLINE SEARCHING; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

BOUNDED DEGREE TREES; COMPLETE GRAPHS;

INTERNET;

EID: 0347541047     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00189-6     Document Type: Conference Paper

References (17)

1. Y. Afek, E. Gafni, M. Ricklin, Upper and lower bounds for routing schemes in dynamic networks, in: Proceedings of the 30th Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, 1989, pp. 370-375.
2. S. Albers, M. Henzinger, Exploring unknown environments, in: Proceedings of the 29th Symposium on Theory of Computing, El Paso, Texas, 1999, pp. 416-425.
3. Awerbuch B., Patt-Shamir B., Varghese G. Self-stabilizing end-to-end communication. J. High Speed Networks. 5:1996;365-381.
4. Baeza-Yates R.A., Culberson J.C., Rawlins G.J.E. Searching in the plane. Inform. and Comput. 106(2):1993;234-252.
5. Bienstock D., Seymour P. Monotonicity in graph searching. J. Algorithms. 12:1991;239-245.
6. Cameron P.J. Topics, Techniques, Algorithms. 1994;Cambridge University Press, Cambridge.
7. W.R. Cockayne, M. Zyda (eds.), Mobile Agents, Manning Publications Co., Greenwich, CT, 1997, http://www.manning.com/Cockayne/Contents.html.
8. R. Cole, B. Maggs, R. Sitaraman, Routing on butterfly networks with random faults, in: Proceedings of the 36th Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, 1995, pp. 558-570.
9. Dolev S., Kranakis E., Krizanc D., Peleg D. Bubbles: Adaptive routing scheme for high-speed networks. SIAM J. Comput. 29(3):1999;804-833.
10. N. Hanusse, E. Kranakis, D. Krizanc, Searching with mobile agents in networks with liars, in: A. Bode, T. Ludwig, W. Karl, R. Wissmuller (Eds.), Proceedings of the Europar 2000, LNCS 1900, 2000, pp. 583-590.
11. L.M. Kirousis, E. Kranakis, D. Krizanc, Y.C. Stamatiou, Locating Information with Uncertainty in Fully Interconnected Networks, in: M. Herlihy (Ed.), Proceedings of the 14th International Conference, DISC 2000, Vol. 1914, Toledo, Spain, October, SVLNCS, 2000, pp. 283-296.
12. Kirousis L., Papadimitriou C. Interval graphs and searching. Discrete Math. 55:1985;181-184.
13. E. Kranakis, D Krizanc, Searching with uncertainty, in: C. Gavoille, J.-C, Bermond, A. Raspaud (Eds.), Proceedings of the Sixth International Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Scientific, Waterloo, Ont., Canada, 1999, pp. 194-203.
14. E. Kushilevitz, Y. Mansour, Computation in noisy radio networks, in: Proceedings of the Ninth Symposium on Discrete Algorithms, San Francisco, California, 1998, pp. 236-243.
15. T. Leighton, B. Maggs, Expanders might be practical, in: Proceedings of the 30th Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, 1989, pp. 384-389.
16. Megiddo N., Hakimi S., Garey M., Johnson D., Papadimitriou C. The complexity of searching a graph. J. ACM. 35:1988;18-44.
17. P. Panaite, A. Pelc, Exploring unknown undirected graphs, in: Proceedings of the Ninth Symposium on Discrete Algorithms, 1998, pp. 316-322.