A Fixed-Parameter Algorithm for Max Edge Domination


In a graph, an edge is said to dominate itself and its adjacent edges. Given an undirected and edge-weighted graph G = (V,E) and an integer k, Max Edge Domination problem (MaxED) is to find a subset K ⊆ E with cardinality at most k such that total weight of edges dominated by K is maximized. MaxED is NP-hard due to the NP-hardness of the minimum edge… (More)


1 Figure or Table