Skip to main content
SpringerLink
Log in

Distributed computing with advice: information sensitivity of graph coloring

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the information sensitivity of a network problem. A problem is information sensitive if little advice is enough to solve the problem rapidly (i.e., much faster than in the absence of any advice), whereas it is information insensitive if it requires giving a lot of information to the nodes in order to ensure fast computation of the solution. In this paper, we study the information sensitivity of distributed graph coloring.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon N., Babai L., Itai A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: 30th Symp. on Foundations of Computer Science (FOCS), pp. 364–369, (1989)

  3. Bellare M., Goldreich O., Sudan M.: Free bits, PCPs, and nonapproximability—towards tight results. SIAM J. Comput. 27(3), 804–915 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. In: 32nd Int. Colloquium on Automata, Languages and Programming (ICALP), LNCS 3580, pp. 335–346 (2005)

  5. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Labeling schemes for tree representation. In: 7th Int. Workshop on Distributed Computing (IWDC), LNCS 3741, pp. 13–24 (2005)

  6. Cole, R., Vishkin, U.: Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In: 18th ACM Symp. on Theory of Computing (STOC), pp. 206–219 (1986)

  7. Feige U., Kilian J.: Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57(2), 187–199 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fich F., Ruppert E.: Hundreds of impossibility results for distributed computing. Distrib. Comput. 16, 121–163 (2003)

    Article  Google Scholar 

  9. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication tasks. In: 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 179–187 (2006)

  10. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. In: 31st Int. Symp. on Mathematical Foundations of Computer Science (MFCS), LNCS 4162, Springer, pp. 24–37 (2006)

  11. Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. In: 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2007)

  12. Goldberg, A., Plotkin, S.: Efficient parallel algorithms for (Δ + 1)-coloring and maximal independent set problems. In: 19th ACM Symp. on Theory of Computing (STOC), pp. 315–324 (1987)

  13. Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. In: 19th ACM Symp. on Theory of Computing (STOC), pp. 315–324 (1987)

  14. Karp, R.: Reducibility Among Combinatorial Problems. In: Complexity of Computer Computations, pp. 85–103 (1972)

  15. Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in \({O(\sqrt{\log n})}\) bit rounds. In: 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2006)

  16. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed Locally! In: 23th ACM Symp. on Principles of Distributed Computing, (PODC), pp. 300–309 (2004)

  17. Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 7–15 (2006)

  18. Linial N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  19. Luby M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lynch, N.: A hundred impossibility proofs for distributed computing. In: 8th ACM Symp. on Principles of Distributed Computing (PODC), pp. 1–28 (1989)

  21. Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 39–48 (2005)

  22. Naor M.: A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J. Discrete Math. 4(3), 409–412 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  23. Naor, M., Stockmeyer, L.: What can be computed locally? In: 25th ACM Symposium on Theory of Computing (STOC), pp. 184–193 (1993)

  24. Nisse, N., Soguet, D.: Graph searching with advice. In: 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO), June 2007

  25. Panconesi A., Rizzi R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14, 97–100 (2001)

    Article  Google Scholar 

  26. Panconesi, A., Srinivasan, A.: Improved distributed algorithms for coloring and network decomposition problems. In: 24th ACM Symp. on Theory of Computing (STOC), pp. 581–592 (1992)

  27. Panconesi A., Srinivasan A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 356–374 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  28. Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM Monographs on Discrete Mathematics and applications. Philadelphia, PA (2000)

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris Diderot, Paris 7, Case 7014, 75205, Paris Cedex 13, France

    Pierre Fraigniaud

  2. LaBRI, Universite Bordeaux 1, 351 cours de la Liberation, 33405, Talence Cedex, France

    Cyril Gavoille & David Ilcinkas

  3. Département d’informatique et d’ingénierie, Université du Québec Outaouais, C.P. 1250, succ. Hull, Gatineau, QC, J8X 3X7, Canada

    Andrzej Pelc

Authors
  1. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyril Gavoille
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Ilcinkas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierre Fraigniaud.

Additional information

A preliminary version of this paper appeared in the proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP), July 2007. A part of this work was done during the stay of David Ilcinkas at the Research Chair in Distributed Computing of the Université du Québec en Outaouais, as a postdoctoral fellow.

P. Fraigniaud received additional support from the ANR project ALADDIN.

A. Pelc was supported in part by NSERC discovery grant and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fraigniaud, P., Gavoille, C., Ilcinkas, D. et al. Distributed computing with advice: information sensitivity of graph coloring. Distrib. Comput. 21, 395–403 (2009). https://doi.org/10.1007/s00446-008-0076-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-008-0076-y

Keywords

Search

Navigation