𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs

✍ Scribed by Brandst�dt, Andreas; Dragan, Feodor F.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
83 KB
Volume
31
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree problems on distance-hereditary graphs.

📜 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