25 citations · 44 across the 5 of their papers we have counts for
3 papers · 1 filter
Collective fast delivery by energy-efficient agents
Andreas Bärtschi, Daniel Graf, Matus Mihalak
We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths) that have to deliver a single item from a given source node s…
Faster Algorithms for All-Pairs Bounded Min-Cuts
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano +5
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum - cut (or just its value) for all pairs of vertices . We study this problem in directed…
A Framework for Searching in Graphs in the Presence of Errors
Dariusz Dereniowski, Stefan Tiegel, Przemysław Uznański +1
We consider the problem of searching for an unknown target vertex in a (possibly edge-weighted) graph. Each \emph{vertex-query} points to a vertex and the response either a…