SIAM Journal on Discrete Mathematics
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Constrained weighted matchings and edge coverings in graphs
Discrete Applied Mathematics
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
An efficient exact algorithm for constraint bipartite vertex cover
Journal of Algorithms
A 2-approximation algorithm for the minimum weight edge dominating set problem
Discrete Applied Mathematics
Edge dominating and hypomatchable sets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Perfect edge domination and efficient edge domination in graphs
Discrete Applied Mathematics
A fixed-parameter tractable algorithm for matrix domination
Information Processing Letters
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Exact (exponential) algorithms for the dominating set problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
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
Domination when the stars are out
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
New parameterized algorithms for the edge dominating set problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
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
Kernels for edge dominating set: simpler or smaller
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Parameterized edge dominating set in graphs with degree bounded by 3
Theoretical Computer Science
New parameterized algorithms for the edge dominating set problem
Theoretical Computer Science
| Hi-index | 0.00 |
We analyze edge dominating set from a parameterized perspective. More specifically, we prove that this problem is in ${\mathcal{FPT}}$ for general (weighted) graphs. The corresponding algorithms rely on enumeration techniques. In particular, we show how the use of compact representations may speed up the decision algorithm.