Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

JGAA
2016

favoriteEmaildiscussreport

58views more JGAA 2016»

An Improved Algorithm for Parameterized Edge Dominating Set Problem

8 years 13 days ago

An Improved Algorithm for Parameterized Edge Dominating Set Problem

Download www.amp.i.kyoto-u.ac.jp

An edge dominating set of a graph G = (V, E) is a subset M ⊆ E of edges such that each edge in E \M is incident to at least one edge in M. In this paper, we consider the parameterized edge dominating set problem which asks us to test whether a given graph has an edge dominating set with size bounded from above by an integer k or not, and we design an O∗ (2.2351k )-time and polynomialspace algorithm. This is an improvement over the previous best time bound of O∗ (2.3147k ). We also show that a related problem: the parameterized weighted edge dominating set problem can be solved in O∗ (2.2351k ) time and polynomial space.

Ken Iwaide, Hiroshi Nagamochi

Real-time Traffic

JGAA 2016 |

claim paper

Related Content

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

» TwoLayer Planarization Parameterized by Feedback Edge Set

» Linear Time Algorithms for Generalized Edge Dominating Set Problems

» Coordinatized Kernels and Catalytic Reductions An Improved FPT Algorithm for Max Leaf Span...

» Parameterized approximation of dominating set problems

» The Parameterized Complexity of Some Minimum Label Problems

» Subexponential Algorithms for Partial Cover Problems

» Distributed algorithms for edge dominating sets

» Threshold Dominating Sets and an Improved Characterization of W2

Post Info
More Details (n/a)

Added	06 Apr 2016
Updated	06 Apr 2016
Type	Journal
Year	2016
Where	JGAA
Authors	Ken Iwaide, Hiroshi Nagamochi

Comments (0)