An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges in the graph such that each edge in E - M is incident with at least one edge in M. In an instance of the parameterized edge dominating set problem we are given a graph G = (V,E) and an integer k and we are asked to decide whether G has an edge dominating set of size at most k. In this paper we show that the parameterized edge dominating set problem can be solved in O*(2.3147 k) time and polynomial space. We also show that this problem can be reduced to a quadratic kernel with O(k 3) edges. © 2011 Springer-Verlag GmbH.
CITATION STYLE
Xiao, M., Kloks, T., & Poon, S. H. (2011). New parameterized algorithms for the edge dominating set problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 604–615). https://doi.org/10.1007/978-3-642-22993-0_54
Mendeley helps you to discover research relevant for your work.