66 citations · 323 across the 55 of their papers we have counts for
Showing 2014 · cs.DMShow all
2 papers · 2 filters
cs.DM2014
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…
cs.DM2014★ 31 cited
Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs
Andreas Brandstädt, Pavel Fičur, Arne Leitert +1
An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient…