𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Permutation graphs: Connected domination and Steiner trees

✍ Scribed by Charles J. Colbourn; Lorna K. Stewart

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
702 KB
Volume
86
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

πŸ“œ SIMILAR VOLUMES

A linear-time algorithm for connectedr-d
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
✍ BrandstοΏ½dt, Andreas; Dragan, Feodor F. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

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