12 citations · 13 across the 4 of their papers we have counts for
4 papers
Perfect Edge Domination: Hard and Solvable Cases
Min Chih Lin, Vadim Lozin, Veronica A. Moyano +1
Let be an undirected graph. An edge of dominates itself and all edges adjacent to it. A subset of edges of is an edge dominating set of , if every edge of the g…
Efficient and Perfect domination on circular-arc graphs
Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter
Given a graph , a \emph{perfect dominating set} is a subset of vertices such that each vertex is dominated by exactly one ve…
An time algorithm for minimum weighted dominating induced matching
Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter
Say that an edge of a graph dominates itself and every other edge adjacent to it. An edge dominating set of a graph is a subset of edges which domina…
Exact algorithms for dominating induced matchings
Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter
Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E' of E which dominates all edg…