Drawing Maps with Advice

  • Dariusz Dereniowski
  • Andrzej Pelc
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6343)


We study the problem of the amount of information required to draw a complete or a partial map of a graph with unlabeled nodes and arbitrarily labeled ports. A mobile agent, starting at any node of an unknown connected graph and walking in it, has to accomplish one of the following tasks: draw a complete map of the graph, i.e., find an isomorphic copy of it including port numbering, or draw a partial map, i.e., a spanning tree, again with port numbering. The agent executes a deterministic algorithm and cannot mark visited nodes in any way. None of these map drawing tasks is feasible without any additional information, unless the graph is a tree. This is due to the impossibility of recognizing already visited nodes. Hence we investigate the minimum number of bits of information (minimum size of advice) that has to be given to the agent to complete these tasks. It turns out that this minimum size of advice depends on the numbers n of nodes or the number m of edges of the graph, and on a crucial parameter μ, called the multiplicity of the graph, which measures the number of nodes that have an identical view of the graph.

We give bounds on the minimum size of advice for both above tasks. For μ= 1 our bounds are asymptotically tight for both tasks and show that the minimum size of advice is very small: for an arbitrary function ϕ = ω(1) it suffices to give ϕ(n) bits of advice to accomplish both tasks for n-node graphs, and Θ(1) bits are not enough. For μ> 1 the minimum size of advice increases abruptly. In this case our bounds are asymptotically tight for topology recognition and asymptotically almost tight for spanning tree construction. We show that Θ(mlogμ) bits of advice are enough and necessary to recognize topology in the class of graphs with m edges and multiplicity μ> 1. For the second task we show that Ω(μlog(n/μ)) bits of advice are necessary and O (μlogn) bits of advice are enough to construct a spanning tree in the class of graphs with n nodes and multiplicity μ> 1. Thus in this case the gap between our bounds is always at most logarithmic, and the bounds are asymptotically tight for multiplicity μ = O(nα), where α is any constant smaller than 1.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)Google Scholar
  2. 2.
    Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing 29, 1164–1188 (2000)MATHCrossRefMathSciNetGoogle Scholar
  3. 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)Google Scholar
  4. 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)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Machine Learning 18, 231–254 (1995)Google Scholar
  6. 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)CrossRefGoogle Scholar
  7. 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)CrossRefGoogle Scholar
  8. 8.
    Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. Journal of Graph Theory 32, 265–297 (1999)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theoretical Computer Science 326, 343–362 (2004)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. Journal of Algorithms 51, 38–63 (2004)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing 21, 395–403 (2009)CrossRefGoogle Scholar
  12. 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)Google Scholar
  13. 13.
    Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. Information and Computation 206, 1276–1287 (2008)MATHCrossRefMathSciNetGoogle Scholar
  14. 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)Google Scholar
  15. 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)CrossRefGoogle Scholar
  16. 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)Google Scholar
  17. 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)Google Scholar
  18. 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)Google Scholar
  19. 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)CrossRefGoogle Scholar
  20. 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)Google Scholar
  21. 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)Google Scholar
  22. 22.
    Norris, N.: Universal covers of graphs: Isomorphism to depth N-1 implies isomorphism to all depths. Discrete Applied Mathematics 56, 61–74 (1995)MATHCrossRefMathSciNetGoogle Scholar
  23. 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)Google Scholar
  24. 24.
    Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1–24 (2005)MATHCrossRefMathSciNetGoogle Scholar
  25. 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Dariusz Dereniowski
    • 1
  • Andrzej Pelc
    • 2
  1. 1.Department of Algorithms and System ModelingGdansk University of TechnologyGdańskPoland
  2. 2.Département d’informatiqueUniversité du Québec en OutaouaisGatineauCanada

Personalised recommendations