Skip to main content
Book cover

Automata and Complexity pp 71–74Cite as

Connectivity and Connected Components in the Number-in-Hand Computation Model

  • 185 Accesses

Part of the Emergence, Complexity and Computation book series (ECC,volume 42)

Abstract

We study the multiparty communication model where players are the nodes of a graph G and each of these nodes knows his/her own identifier together with the identifiers of his/her neighbors. The nodes simultaneously send a unique message to a referee who must give the output (which is a fiunction of G). In this paper we prove that counting the numbers of connected components of G and deciding the connectivity of G are equivalent problems (in terms of the size of the messages).

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-92551-2_6
  • Chapter length: 4 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-030-92551-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Hardcover Book
USD   199.99
Price excludes VAT (USA)
Learn about institutional subscriptions
Fig. 1

References

  1. Ahn KJ, Guha S, McGregor A (2012) Analyzing graph structure via linear measurements. In: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA ’12, pp 459–467

    Google Scholar 

  2. Ahn KJ, Guha S, McGregor A (2012) Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st symposium on principles of database systems, PODS ’12, pp 5–14

    Google Scholar 

  3. Becker F, Matamala M, Nisse N, Rapaport I, Suchan K, Todinca I (2011) Adding a referee to an interconnection network: What can(not) be computed in one round. In: IPDPS. IEEE, pp 508–514

    Google Scholar 

  4. Becker F, Montealegre P, Rapaport I, Todinca I (2014) The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism. In: International colloquium on structural information and communication complexity, pp 83–95. Springer

    Google Scholar 

  5. Drucker A, Kuhn F, Oshman R (2012) The communication complexity of distributed task allocation. In: Proceedings of the 2012 ACM symposium on principles of distributed computing, PODC ’12, pp 67–76

    Google Scholar 

  6. Gronemeier A (2009) Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness. In: Proceedings of the 26th international symposium on theoretical aspects of computer science, STACS ’09, pp 505–516

    Google Scholar 

  7. Jaymar TS (2009) Hellinger strikes back: a note on the multi-party information complexity of AND. In: Approximation, randomization, and combinatorial optimization. Algorithms and techniques, vol 5687. Lecture Notes in Computer Science, pp 562–573

    Google Scholar 

  8. Phillips JM, Verbin E, Zhang Q (2012) Lower bounds for number-in-hand multiparty communication complexity, made easy. In: Proceedings of the twenty-third annual ACM-SIAM symposium on discrete algorithms, SODA ’12. SIAM, pp 486–501

    Google Scholar 

  9. Woodruff DP, Zhang Q (2013) When distributed computation is communication expensive. In: Proceedings of the 27th international symposium on distributed computing, vol 8205. Lecture Notes in Computer Science, DISC ’13, pp 16–30

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Adolfo Ibáñez, Santiago, Chile

    Antonio Lizama

  2. DIM-CMM (UMI 2807 CNRS), Universidad de Chile, Santiago, Chile

    Ivan Rapaport

Authors
  1. Antonio Lizama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivan Rapaport
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Rapaport .

Editor information

Editors and Affiliations

  1. Unconventional Computing Centre, University of the West of England, Bristol, UK

    Prof. Andrew Adamatzky

Rights and permissions

Reprints and Permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Verify currency and authenticity via CrossMark

Cite this chapter

Lizama, A., Rapaport, I. (2022). Connectivity and Connected Components in the Number-in-Hand Computation Model. In: Adamatzky, A. (eds) Automata and Complexity. Emergence, Complexity and Computation, vol 42. Springer, Cham. https://doi.org/10.1007/978-3-030-92551-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92551-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92550-5

  • Online ISBN: 978-3-030-92551-2

  • eBook Packages: EngineeringEngineering (R0)