
Collective fast delivery by energyefficient agents
We consider k mobile agents initially located at distinct nodes of an un...
read it

Faster Algorithms for AllPairs Bounded MinCuts
Given a directed graph, the vertex connectivity from u to v is the maxim...
read it

A Framework for Searching in Graphs in the Presence of Errors
We consider two types of searching models, where the goal is to design a...
read it

Hamming distance completeness and sparse matrix multiplication
We investigate relations between (+,) vector products for binary integer...
read it
Daniel Graf
is this you? claim profile