𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees

✍ Scribed by Cohen; Fraigniaud; Mitjana

Publisher
Springer
Year
2002
Tongue
English
Weight
250 KB
Volume
35
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear-time algorithm for broadcast do
A linear-time algorithm for broadcast domination in a tree
✍ John Dabney; Brian C. Dean; Stephen T. Hedetniemi πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

## Abstract The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power __p__ at vertex __v__ is capable of dominating (broadcasting to) all vertices within distance __p__ from __v__. Our goal is to assign a broadcast power __f__(__v

A polynomial time algorithm recognizing
A polynomial time algorithm recognizing link trees
✍ Peter Bugata; Attila Nagy; Roman VΓ‘vra πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 672 KB

The link of a vertex u of a graph G is the subgraph induced by all vertices adjacent to u . If all the links of G are isomorphic to a finite graph L, then G is called a realization of L, and L is called a link graph. At the Smolenice symposium of 1963, Zykov posed the problem of recognizing iink gr