L. Penso

activity

20032022

most citedA distributed algorithm to find k-dominating sets

30 citations · 30 across the 5 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DM2018

Dynamic monopolies for interval graphs with bounded thresholds

Stéphane Bessy, Stefan Ehard, Lucia D. Penso +1

For a graph $G$ and an integer-valued threshold function $τ$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G…

math.CO2018

Partial immunization of trees

Mitre C. Dourado, Stefan Ehard, Lucia D. Penso +1

For a graph $G$ and an integer-valued function $τ$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that hav…