@article{MAKHILLAJIT202019106813,
    title = {A Novel Approach to Compute Steiner Point in Graph: Application for Network Design},
    journal = {Asian Journal of Information Technology},
    volume = {19},
    number = {10},
    pages = {242-248},
    year = {2020},
    issn = {1682-3915},
    doi = {ajit.2020.242.248},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2020.242.248},
    author = {Shantanu,Shashank and},
    keywords = {Graph,network,cable length,steiner point,data structures},
    abstract = {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.}
    }