66 citations · 204 across the 20 of their papers we have counts for
3 papers · 1 filter
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi
We study a relaxation of the Vector Domination problem called Vector Connectivity (VecCon). Given a graph with a requirement for each vertex , VecCon asks for a minim…
On the Tree Search Problem with Non-uniform Costs
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický +2
Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge repre…
How to go Viral: Cheaply and Quickly
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +3
Given a social network represented by a graph , we consider the problem of finding a bounded cardinality set of nodes with the property that the influence spreading from …