On generating all maximal independent sets
Information Processing Letters
A 2-approximation algorithm for the minimum weight edge dominating set problem
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
Theory of Computing Systems
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
Exact algorithms for edge domination
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact and parameterized algorithms for edge dominating set in 3-degree graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Parameterized edge dominating set in cubic graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A simple and fast algorithm for maximum independent set in 3-degree graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A refined exact algorithm for edge dominating set
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Hi-index | 5.23 |
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.