M. Lin

activity

20132017

most citedExact algorithms for dominating induced matchings

12 citations · 13 across the 4 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2017

Perfect Edge Domination: Hard and Solvable Cases

Min Chih Lin, Vadim Lozin, Veronica A. Moyano +1

Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E^{'}$ of edges of $G$ is an edge dominating set of $G$ , if every edge of the g…

cs.DM2015★ 1 cited

Efficient and Perfect domination on circular-arc graphs

Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter

Given a graph $G = (V, E)$ , a \emph{perfect dominating set} is a subset of vertices $V^{'} \subseteq V (G)$ such that each vertex $v \in V (G) ∖ V^{'}$ is dominated by exactly one ve…

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…