Temporal graphs (or evolving graphs) are time-varying graphs where time is assumed to be
discrete. In this paper, we consider for the first time the problem of exploring temporal graphs …

The rotor-router mechanism was introduced as a deterministic alternative to the random
walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel …

We consider, for the first time, the exploration of dynamic graphs of arbitrary unknown
topology. We study the number of agents necessary and sufficient to explore such graphs …

We consider the problem of deterministic load balancing of tokens in the discrete model. A
set of n processors is connected into ad-regular undirected network. In every timestep, each …

Flooding is among the simplest and most fundamental of all graph/network algorithms.
Consider a (distributed network in the form of a) finite undirected graph G with a …

Consider k identical robots traversing the edges of a geometric tree. The robots have to
patrol the tree by perpetually moving along edges, but without exceeding their maximum unit …

The rotor-router model, also called the Propp machine, was introduced as a deterministic
alternative to the random walk. In this model, a group of identical tokens are initially placed …

The rotor-router mechanism was introduced as a deterministic alternative to the random
walk in undirected graphs. In this model, an agent is initially placed at one of the nodes of …

The rotor-router model is a deterministic process analogous to a simple random walk on a
graph. This paper is concerned with a generalized model, functional-router model, which …

The rotor–router model, also called the Propp machine, was first considered as a
deterministic alternative to the random walk. The edges adjacent to each node v (or …