Sciweavers

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

11

CORR
2010
Springer

favoriteEmaildiscussreport

156views Education» more CORR 2010»

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set

13 years 4 months ago

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set

Download www.cs.sfu.ca

A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no vertices in D are pairwise adjacent, then D is said to be an independent dominating set. Finding a minimum independent dominating set in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating

Serge Gaspers, Mathieu Liedloff

Real-time Traffic

CORR 2010 | Dominating Set | Education | NP-hard Problem |

claim paper

Related Content

» Approximating minimum independent dominating sets in wireless networks

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

» Approximating minimum size weaklyconnected dominating sets for clustering mobile ad hoc ne...

» Minimum Connected Dominating Sets of Random Cubic Graphs

» On minimum m connected k dominating set problem in unit disc graphs

» Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks

» Distributed Connected Dominating Set Construction in Geometric kDisk Graphs

» InclusionExclusion Branching for Partial Dominating Set and Set Splitting

» TwoPhased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Serge Gaspers, Mathieu Liedloff

Comments (0)