5 citations · 14 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2014
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs
Shantanu Das, Dariusz Dereniowski, Adrian Kosowski +1
We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However t…
cs.DS2014★ 2 cited
Improved Analysis of Deterministic Load-Balancing Schemes
Petra Berenbrink, Ralf Klasing, Adrian Kosowski +2
We consider the problem of deterministic load balancing of tokens in the discrete model. A set of processors is connected into a -regular undirected network. In every time s…
cs.DS2012★ 2 cited
Faster Walks in Graphs: A Time-Space Trade-off for Undirected s-t Connectivity
Adrian Kosowski
In this paper, we make use of the Metropolis-type walks due to Nonaka et al. (2010) to provide a faster solution to the --connectivity problem in undirected graphs (USTCON).…