42 citations · 103 across the 21 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2014★ 5 cited
Lock-in Problem for Parallel Rotor-router Walks
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski +3
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 pl…
cs.DM2014★ 5 cited
Distinguishing Views in Symmetric Networks: A Tight Lower Bound
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak
The view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers , there…
cs.DM2010★ 23 cited
On the size of identifying codes in triangle-free graphs
Florent Foucaud, Ralf Klasing, Adrian Kosowski +1
In an undirected graph , a subset such that is a dominating set of , and each vertex in is dominated by a distinct subset of vertices from , i…