TY  - JOUR
T1  - A Novel Approach to Compute Steiner Point in Graph: Application for Network Design
AU - Agrawal, Shantanu AU - Bhalotial, Shashank AU - Chandak, M.B. 
JO  - Asian Journal of Information Technology
VL  - 19
IS  - 10
SP  - 242
EP  - 248
PY  - 2020
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2020.242.248
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2020.242.248
KW  - Graph
KW  -network
KW  -cable length
KW  -steiner point
KW  -data structures
AB  - In graph the two main components are Vertices
and Edges. The vertices are connected using edges. There
are two types of graphs, directed and undirected. The
major application of graph is representing network on
paper. The cost involved in converting paper based
network to actual cable based network is majorly
controlled by cables required for connection. The cost can
be reduced if the length of cable can be reduced. The
paper describes, methodology to compute steiner point.
Using steiner point it is possible to modify the position of
vertices, so as to reduce the cable length, keeping the
vertex connectivity intact. The study describes
implementation of steiner point on graph with number of
vertices-3,4,5,6, etc. The presented work can be applied
for graph with any number of vertices. It is optimization
approach to reduce the cable size and cost of
implementation of network.
ER  -