✦ LIBER ✦

Thek-Steiner Ratio in Graphs

✍ Scribed by Borchers, Al; Du, Ding-Zhu

Book ID: 118177431
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 293 KB
Volume: 26
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539795281086

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Thek-Steiner Ratio in the Rectilinear Pl

Thek-Steiner Ratio in the Rectilinear Plane

✍ Al Borchers; Ding-Zhu Du; Biao Gao; Pengjun Wan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 240 KB

A Steiner minimum tree SMT in the rectilinear plane is the shortest length tree interconnecting a set of points, called the regular points, possibly using Ž . additional vertices. A k-size Steiner minimum tree kSMT is one that can be split into components where all regular points are leaves and all

Steiner intervals in graphs

✍ Ewa Kubicka; Grzegorz Kubicki; Ortrud R. Oellermann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 664 KB

Let G be a graph and U, L' two vertices of G. Then the interval from K to 2' consists of all those vertices that lie on some shortest u -1; path. Let S be a set of vertices in a connected graph G. Then the Steiner distance d,(S) of S in G is the smallest number of edges in a connected subgraph of G

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

Steiner Numbers in Graphs

✍ Oellermann, Ortrud R. 📂 Article 📅 1990 🏛 Taylor and Francis Group 🌐 English ⚖ 212 KB

EXTREME STEINER GRAPHS

✍ SANTHAKUMARAN, A. P. 📂 Article 📅 2012 🏛 World Scientific 🌐 English ⚖ 239 KB

The steiner problem in graphs

✍ S. E. Dreyfus; R. A. Wagner 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB