Sciweavers

Share
WG
2005
Springer

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time

10 years 14 days ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
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
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where WG
Authors Pinar Heggernes, Daniel Lokshtanov
Comments (0)
books