8 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.DM2024★ 2 cited
Reducing Dominating Sets in Graphs
Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania
A dominating set of a graph is a subset of vertices such that every vertex has at least one neighbor in set . The corresponding opti…
cs.DM2023★ 3 cited
Algorithms for the Global Domination Problem
Ernesto Parra Inza, Nodari Vakhania, Jose M. Sigarreta Almira +1
A dominating set D in a graph G is a subset of its vertices such that every vertex of the graph which does not belong to set D is adjacent to at least one vertex from set D. A set…
cs.DS2022★ 8 cited
Exact and Heuristic Algorithms for the Domination Problem
Ernesto Parra Inza, Frank Angel Hernández Mira, José María Sigarreta Almira +1
In a simple connected graph , a subset of vertices is a dominating set if any vertex is adjacent to some vertex from this subset.…