𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner centers and Steiner medians of graphs

✍ Scribed by Hong-Gwa Yeh; Chun-Ying Chiang; Sheng-Hueng Peng

Book ID
108113908
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
206 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Steiner centers and Steiner medians o
On Steiner centers and Steiner medians of graphs
✍ Oellermann, Ortrud R. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 143 KB

Let G be connected graph and S a set of vertices of G. Then a Steiner tree for S is a connected subgraph of G of smallest size (number of edges) that contains S. The size of such a subgraph is called the Steiner distance for S and is denoted by d(S). For a vertex v of G, and integer n, 2 Υ… n Υ… Ν‰V(G)

From steiner centers to steiner medians
From steiner centers to steiner medians
✍ Ortrud R. Oellermann πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 457 KB

## Abstract The Steiner distance of set __S__ of vertices in a connected graph __G__ is the minimum number of edges in a connected subgraph of __G__ containing __S__. For __n__ β‰₯ 2, the Steiner __n__‐eccentricity __e~n~__(__v__) of a vertex __v__ of a graph __G__ is the maximum Steiner distance amo

Steiner centers in graphs
Steiner centers in graphs
✍ Ortrud R. Oellermann; Songlin Tian πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 515 KB

## Abstract The Steiner distance of a set __S__ of vertices in a connected graph __G__ is the minimum size among all connected subgraphs of __G__ containing __S.__ For __n__ β‰₯ 2, the __n__‐eccentricity __e~n~__(Ξ½) of a vertex Ξ½ of a graph __G__ is the maximum Steiner distance among all sets __S__ o

On the Steiner median of a tree
On the Steiner median of a tree
✍ Lowell W. Beineke; Ortrud R. Oellermann; Raymond E. Pippert πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 639 KB
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.