12 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.DM2015★ 1 cited
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…
cs.DS2013
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…
cs.DM2013★ 12 cited
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…