Results 251 to 260 of about 1,735,900 (276)

Steiner Distance in Join, Corona and Threshold Graphs

2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC), 2017
For a connected graph G and a subset S of its vertices, the Steiner tree problem consists of finding a minimum-size connected subgraph containing S. The Steiner distance of S is the size of a Steiner tree for S, and the Steiner k-diameter of G is the maximum value of the Steiner distance over all vertex subsets S of cardinality k.
Yaping Mao, Eddie Cheng, Christopher Melekian   +2 more
exaly   +3 more sources

On Steiner minimal trees withL p distance

Algorithmica, 1992
Let \(L\) be the plane with the distance \(d_ p((x_ 1,x_ 2),(y_ 1,y_ 2))=(| x_ 1-x_ 2|^ p+| y_ 1-y_ 2|^ p)^{1/p}\). Let \(P\) be a finite set of points in \(L_ p\) and let \(L_ s(P)\) be the length of a Steiner minimal tree, i.e. of a shortest network interconnecting \(P\) which may contain vertices not in \(P\) --- called Steiner points.
Zicheng Liu 0001, Ding-Zhu Du
openaire   +3 more sources

The 2-Steiner distance matrix of a tree

Linear Algebra and its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Azimi, Ali, Sivasubramanian, Sivaramakrishnan   +1 more
openaire   +2 more sources

The Steiner distance dimension of graphs

Australas. J Comb., 1999
For a connected graph the authors define the Steiner basis and the Steiner distance dimension. These notions have a close relation to some chemical problems. The authors then describe graphs with \(n\) vertices that have (i) Steiner dimension 1 or \(n-1\) and (ii) Steiner dimension \(n-2\) for \(n\geq 4\).
Michael E. Raines, Ping Zhang 0004
openaire   +2 more sources

On Steiner Minimal Trees with Rectilinear Distance

SIAM Journal on Applied Mathematics, 1976
We consider Steiner minimal trees in the plane with rectilinear distance. The rectilinear distance $d(p_1 ,p_2 )$ between two points $p_1 $, $p_2 $ is $| {x_1 - x_2 } | + | {y_1 - y_2 } |$, where the $(x_i ,y_i )$ are the Cartesian coordinates of the $p_i $. For a given finite set P of points, let $l_s $ denote the length of a Steiner minimal tree and $
openaire   +1 more source

Path-distance heuristics for the Steiner problem in undirected networks

Algorithmica, 1992
The authors give a common characterization of three heuristics for the Steiner minimum tree problem: shortest path heuristic, distance network heuristic and average distance heuristic. The foregoing single path heuristics and some variations are extended using repetitive application of the shortest path heuristic.
Winter, P., Smith, J.M.
openaire   +1 more source

Steiner Distance Polynomial of Graph

مجلة الباحث الجامعي للعلوم الانسانية, 2006
يتم تعريف متعدد الحدود لمسافة n-شتاينر للرسم البياني المتصل G, Wn(G;x)، على أنه  Mn(G,k)xkm  حيث Mn(G, k)  هو عدد مجموعات n من رؤوس G التي تكون على مسافة-n K.  يتم الحصول على Wn(G;x) لبعض الرسوم البيانية الخاصة وللرسم البياني المركب G1 • G2 وG1:G2. علاوة على ذلك، فإننا نعطي حدًا أعلى لمتوسط المسافة n μn(G)  
openaire   +1 more source

The Steiner and Gromov–Steiner Ratios and Steiner Subratio in the Space of Compacta in the Euclidean Plane with Hausdorff Distance

Journal of Mathematical Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Steiner Distance Related Parameters of Wheel graphs

Tuijin Jishu/Journal of Propulsion Technology, 2023
For a connected graph of order at least  and  the Steiner distance  among the vertices of  is the minimum size among all the connected subgraphs whose vertex sets contain  In this paper, we calculate the Steiner distance parameters such as Steiner degree distance, Steiner Gutman index, Steiner Harary index and Steiner reciprocal degree distance of a ...
openaire   +1 more source

On shortest two-connected Steiner networks with Euclidean distance

Networks, 1998
Summary: We consider the problem of constructing the shortest two-connected Steiner network on the Euclidean plane. For a given set \(P\) of points on the Euclidean plane, let \(l_2(P)\) denote the length of the shortest two-connected Steiner network on \(P\) divided by the length of the shortest two-connected spanning network on \(P\). We prove that \(
D. Frank Hsu, Xiao-Dong Hu 0001
openaire   +3 more sources