Exact and parameterized algorithms for edge dominating set in 3-degree graphs

Authors:
Mingyu Xiao
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu , P.R. China
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 17
Cited 5

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems

Algorithmica
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques

Theory of Computing Systems
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

Algorithmica - Parameterized and Exact Algorithms
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3

Journal of Discrete Algorithms
On Two Techniques of Combining Branching and Treewidth

Algorithmica
Pathwidth of cubic graphs and exact algorithms

Information Processing Letters
3-coloring in time O (1.3289n)

Journal of Algorithms
Exact algorithms for edge domination

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A note on vertex cover in graphs with maximum degree 3

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Exact computation of maximum induced forest

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Maximum independent set in graphs of average degree at most three in O(1.08537n)

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
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
An improved exact algorithm for cubic graph TSP

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

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
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph G = (V, E), the edge dominating set problem is to find a minimum set M ⊆ E such that each edge in E - M has at least one common endpoint with an edge in M. The edge dominating set problem is an important graph problem and has been extensively studied. It is well known that the problem is NP-hard, even when the graph is restricted to a planar or bipartite graph with maximum degree 3. In this paper, we show that the edge dominating set problem in graphs with maximum degree 3 can be solved in O*(1.2721n) time and polynomial space, where n is the number of vertices in the graph. We also show that there is an O*(2.2306k)-time polynomial-space algorithm to decide whether a graph with maximum degree 3 has an edge dominating set of size k or not. Above two results improve previously known results on exact and parameterized algorithms for this problem.