An Exact Algorithm for Lowest Edge Dominating Set


IEICE TRANSACTIONS on Information and Systems   Vol.E100-D   No.3   pp.414-421
Publication Date: 2017/03/01
Publicized: 2016/12/21
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2016FCP0005
Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Theoretical Computer Science —)
graph theory,  edge dominating set,  algorithm,  NP-completeness,  fixed parameter tractable,  

Full Text: PDF>>
Buy this Article

Given an undirected graph G, an edge dominating set is a subset F of edges such that each edge not in F is adjacent to some edge in F, and computing the minimum size of an edge dominating set is known to be NP-hard. Since the size of any edge dominating set is at least half of the maximum size µ(G) of a matching in G, we study the problem of testing whether a given graph G has an edge dominating set of size ⌈µ(G)/2⌉ or not. In this paper, we prove that the problem is NP-complete, whereas we design an O*(2.0801µ(G)/2)-time and polynomial-space algorithm to the problem.