27 citations · 38 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Target set selection with maximum activation time
Lucas Keiler, Carlos Vinicius G. C. Lima, Ana Karolinna Maia +2
A target set selection model is a graph with a threshold function upper-bounded by the vertex degree. For a given model, a set is a targ…
cs.DS2018★ 6 cited
FPT algorithms to recognize well covered graphs
Rafael Araujo, Eurinardo Costa, Sulamita Klein +2
Given a graph , let and be the sizes of a minimum and a maximum minimal vertex covers of , respectively. We say that is well covered if …