๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Steiner trees, connected domination and strongly chordal graphs

โœ Scribed by Kevin White; Martin Farber; William Pulleyblank

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
829 KB
Volume
15
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Permutation graphs: Connected domination
Permutation graphs: Connected domination and Steiner trees
โœ Charles J. Colbourn; Lorna K. Stewart ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 702 KB

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.

Strong clique trees, neighborhood trees,
Strong clique trees, neighborhood trees, and strongly chordal graphs
โœ McKee, Terry A. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 137 KB ๐Ÿ‘ 1 views

Maximal complete subgraphs and clique trees are basic to both the theory and applications of chordal graphs. A simple notion of strong clique tree extends this structure to strongly chordal graphs. Replacing maximal complete subgraphs with open or closed vertex neighborhoods discloses new relationsh

Finding dominating cliques efficiently,
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
โœ Dieter Kratsch ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 914 KB

We study a new version of the domination problem in which the dominating set is required to be a clique. The minimum dominating clique problem is NP-complete for split graphs and, hence, for chordal graphs. We show that for two other important subclasses of chordal graphs the problem is solvable eff