25 citations · 126 across the 37 of their papers we have counts for
Showing 2016 · cs.DSShow all
3 papers · 2 filters
cs.DS2016
Deterministic Graph Exploration with Advice
Barun Gorain, Andrzej Pelc
We consider the task of graph exploration. An -node graph has unlabeled nodes, and all ports at any node of degree are arbitrarily numbered . A mobile agent ha…
cs.DS2016★ 2 cited
Impact of Knowledge on Election Time in Anonymous Networks
Yoann Dieudonné, Andrzej Pelc
Leader election is one of the basic problems in distributed computing. For anonymous networks, the task of leader election is formulated as follows: every node v of the network mus…
cs.DS2016
Exploration of Faulty Hamiltonian Graphs
David Caissy, Andrzej Pelc
We consider the problem of exploration of networks, some of whose edges are faulty. A mobile agent, situated at a starting node and unaware of which edges are faulty, has to explor…