Drawing maps with advice

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

Volumn 6343 LNCS, Issue , 2010, Pages 328-342

  Dereniowski, Dariusz ^a   Pelc, Andrzej ^b  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; ARBITRARY FUNCTIONS; CONNECTED GRAPH; CRUCIAL PARAMETERS; DETERMINISTIC ALGORITHMS; NODE GRAPH; SPANNING TREE; SPANNING TREE CONSTRUCTION; TOPOLOGY RECOGNITION;

ASYMPTOTIC ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION DISSEMINATION; MOBILE AGENTS; PARALLEL ARCHITECTURES; TOPOLOGY;

TREES (MATHEMATICS);

EID: 78649898199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15763-9_30     Document Type: Conference Paper

References (25)

1. Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ), pp. 547-556 (2001)
2. Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing 29, 1164-1188 (2000)
3. Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 82-93 (1980)
4. Bender, M.A., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation 176, 1-21 (2002)
5. Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Machine Learning 18, 231-254 (1995)
6. Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33-47. Springer, Heidelberg (2001)
7. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 335-346. Springer, Heidelberg (2005)
8. Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. Journal of Graph Theory 32, 265-297 (1999)
9. Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theoretical Computer Science 326, 343-362 (2004)
10. Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. Journal of Algorithms 51, 38-63 (2004)
11. Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing 21, 395-403 (2009)
12. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication problems. In: Proc. 25th Ann. ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 179-187 (2006)
13. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. Information and Computation 206, 1276-1287 (2008)
14. Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. In: Proc. 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 154-160 (2007)
15. Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 242-256. Springer, Heidelberg (2008)
16. Fusco, E., Pelc, A.: Trade-offs between the size of advice and broadcasting time in trees. In: Proc. 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), pp. 77-84 (2008)
17. Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 585-594 (2007)
18. Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 210-219 (2001)
19. Ilcinkas, D., Kowalski, D., Pelc, A.: Fast radio broadcasting with advice. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 291-305. Springer, Heidelberg (2008)
20. Katz, M., Katz, N., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 927-936 (2002)
21. Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC 2005), pp. 9-18 (2005)
22. Norris, N.: Universal covers of graphs: Isomorphism to depth N-1 implies isomorphism to all depths. Discrete Applied Mathematics 56, 61-74 (1995)
23. Soguet, D., Nisse, N.: Graph searching with advice. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 51-65. Springer, Heidelberg (2007)
24. Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1-24 (2005)
25. Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems 7, 69-89 (1996)