Sciweavers

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

25

WG
2005
Springer

favoriteEmaildiscussreport

96views Theoretical Computer Science» more WG 2005»

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time

14 years 4 months ago

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time

Download www.ii.uib.no

Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broadcast domination assigns a power f(v) ≥ 0 to each vertex v of a given graph, such that every vertex of the graph is within distance f(v) from some vertex v

Pinar Heggernes, Daniel Lokshtanov

Real-time Traffic

Broadcast Domination | Computer Science | Various Domination Powers | WG 2005 |

claim paper

Related Content

» Optimal broadcast domination in polynomial time

» Polynomial Time Data Reduction for Dominating Set

» Broadcast Disks with Polynomial Cost Functions

» Approximation Algorithms for Connected Dominating Sets

» Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

» Polynomialtime subgraph enumeration for automated instruction set extension

» Skewed allocation of nonuniform data for broadcasting over multiple channels

» Asynchronous Broadcast in Radio Networks

» BandwidthEfficient Collective Communication for Clustered Wide Area Systems

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WG
Authors	Pinar Heggernes, Daniel Lokshtanov

Comments (0)