Elements of the theory of dynamic networks
O Michail, PG Spirakis - Communications of the ACM, 2018 - dl.acm.org
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 …
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …
An introduction to temporal graphs: An algorithmic perspective
O Michail - Internet Mathematics, 2016 - Taylor & Francis
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 …
discrete and only the relationships between the participating entities may change and not …
[HTML][HTML] Traveling salesman problems in temporal graphs
O Michail, PG Spirakis - Theoretical Computer Science, 2016 - Elsevier
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 …
problems. In particular, we study problems defined on temporal graphs. A temporal graph …
Temporal network optimization subject to connectivity constraints
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 …
to each edge of an underlying graph G a set of discrete time-labels. The labels of an edge …
Stone age distributed computing
Y Emek, R Wattenhofer - Proceedings of the 2013 ACM symposium on …, 2013 - dl.acm.org
A new model that depicts a network of randomized finite state machines operating in an
asynchronous environment is introduced. This model, that can be viewed as a hybrid of the …
asynchronous environment is introduced. This model, that can be viewed as a hybrid of the …
Almost logarithmic-time space optimal leader election in population protocols
The model of population protocols refers to a large collection of simple indistinguishable
entities, frequently called\em agents. The agents communicate and perform computation …
entities, frequently called\em agents. The agents communicate and perform computation …
A survey on analog models of computation
A Survey on Analog Models of Computation Page 1 Chapter 6 A Survey on Analog Models of
Computation Olivier Bournez and Amaury Pouly Abstract We present a survey on analog …
Computation Olivier Bournez and Amaury Pouly Abstract We present a survey on analog …
Mediated population protocols
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 …
order to model more powerful networks of resource-limited agents that are possibly mobile …
Simple and efficient local codes for distributed stable network construction
O Michail, PG Spirakis - Proceedings of the 2014 ACM symposium on …, 2014 - dl.acm.org
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 …
networks. In order to highlight the basic principles of distributed network construction we …
Temporal network optimization subject to connectivity constraints
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 …
each edge of an underlying graph G a set of discrete time-labels. The labels of an edge …