Now showing items 64-66 of 100

    • Reliably Detecting Connectivity Using Local Graph Traits 

      Cornejo Collado, Alex; Lynch, Nancy Ann (Springer, 2010-12)
      Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global ...
    • Distributed computation in dynamic networks 

      Kuhn, Fabian; Lynch, Nancy Ann; Oshman, Rotem (Association for Computing Machinery, 2010)
      In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen ...
    • Partial Reversal Acyclicity 

      Radeva, Tsvetomira; Lynch, Nancy (2011-04-14)
      Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving ...