Elements of the theory of dynamic networks Page 1 72 COMMUNICATIONS OF THE ACM |
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …

A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …

In this work, we introduce the notion of time to some well-known combinatorial optimization
problems. In particular, we study problems defined on temporal graphs. A temporal graph …

In this work we consider temporal networks, ie networks defined by a labeling λ λ assigning
to each edge of an underlying graph G a set of discrete time-labels. The labels of an edge …

We extend here the Population Protocol (PP) model of Angluin et al.(2004, 2006)[2, 4] in
order to model more powerful networks of resource-limited agents that are possibly mobile …

In this work, we study protocols so that populations of distributed processes can construct
networks. In order to highlight the basic principles of distributed network construction we …

In this work we consider temporal networks, ie networks defined by a labeling λ assigning to
each edge of an underlying graph G a set of discrete time-labels. The labels of an edge …

A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …

We propose a new theoretical model for passively mobile Wireless Sensor Networks, called
PM, standing for Passively mobile Machines. The main modification wrt the Population …

Highly dynamic networks rarely offer end-to-end connectivity at a given time. Yet,
connectivity in these networks can be established over time and space, based on temporal …