We present an O∗(1.3160n)-time algorithm for the edge dominating set problem in an n-vertex graph, which improves previous exact algorithms for this problem. The algorithm is analyzed by using the “Measure and Conquer method.” We design new branching rules based on conceptually simple local structures, called “clique-producing vertices/cycles,” which significantly simplify the algorithm and its...

We study network coding for multi-hop wireless networks. We focus the case of broadcasting, where one source transmits information to all the nodes in the network. Our goal is energy-efficient broadcasting, in other words, to minimize the number of transmissions for broadcasting to the entire network. To achieve this goal, we propose a family of methods that combine the use of network coding an...

An edge dominating set D of graph G = (V; E) is a set of edges such that every edge not in D is adjacent to at least an edge in D. In this paper we develop polynomial time algorithms for nding a minimum edge dominating set for a cotriangulated graph and a bipartite permutation graph.

Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (CDS) based routing is a promising approach for enhancing the routing efficiency in sensor networks. Our idea is to generate a quality based CDS algorithm, which can resolve the standing issues like cardinality, risk fac...

Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Previous literature modeled the wireless network in a 2-dimensional plane and looked for the approximated Minimum CDS (MCDS) distributed or centralized to construct the virtual backbone of the wireless network. However, in some real situatio...

3 Energy efficient broadcasting without range adjustment 10 3.1 Clustering based broadcasting protocols . . . . . . . . . . . . . . . . 11 3.2 Neighbor elimination based broadcasting protocols . . . . . . . . . . 11 3.3 Distance-based and probabilistic protocols . . . . . . . . . . . . . . . 11 3.4 Coverage and connected dominating set based broadcasting . . . . . 12 3.5 Forwarding neighbors ba...

For any edge of an isolate free graph , , 〈 〉 is the subgraph induced by the vertices adjacent to u and v in G. We say that an edge x, edominates an edge y if ∈ 〈 〉 . A set ⊆ is an Edge-Edge Dominating Set (EED-set) if every edge in is e-dominated by an edge in L. The edgeedge domination number is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some...