Open Access   Article Go Back

A novel Approach to Compute Steiner point in Graph: Application for Network Design

M.B.Chandak 1 , S.Bhalotia 2 , S.C.Agrawal 3

  1. Dept. of CSE, Shri Ramdeobaba College of Engineering and Management, Nagpur, India.
  2. Dept. of CSE, Shri Ramdeobaba College of Engineering and Management, Nagpur, India.
  3. Dept. of CSE, Shri Ramdeobaba College of Engineering and Management, Nagpur, India.

Correspondence should be addressed to: hodcs@rknec.edu.

Section:Review Paper, Product Type: Journal Paper
Volume-5 , Issue-9 , Page no. 224-231, Sep-2017

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v5i9.224231

Online published on Sep 30, 2017

Copyright © M.B.Chandak, S.Bhalotia, S.C.Agrawal . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: M.B.Chandak, S.Bhalotia, S.C.Agrawal, “A novel Approach to Compute Steiner point in Graph: Application for Network Design,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.9, pp.224-231, 2017.

MLA Style Citation: M.B.Chandak, S.Bhalotia, S.C.Agrawal "A novel Approach to Compute Steiner point in Graph: Application for Network Design." International Journal of Computer Sciences and Engineering 5.9 (2017): 224-231.

APA Style Citation: M.B.Chandak, S.Bhalotia, S.C.Agrawal, (2017). A novel Approach to Compute Steiner point in Graph: Application for Network Design. International Journal of Computer Sciences and Engineering, 5(9), 224-231.

BibTex Style Citation:
@article{_2017,
author = {M.B.Chandak, S.Bhalotia, S.C.Agrawal},
title = {A novel Approach to Compute Steiner point in Graph: Application for Network Design},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2017},
volume = {5},
Issue = {9},
month = {9},
year = {2017},
issn = {2347-2693},
pages = {224-231},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1461},
doi = {https://doi.org/10.26438/ijcse/v5i9.224231}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v5i9.224231}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1461
TI - A novel Approach to Compute Steiner point in Graph: Application for Network Design
T2 - International Journal of Computer Sciences and Engineering
AU - M.B.Chandak, S.Bhalotia, S.C.Agrawal
PY - 2017
DA - 2017/09/30
PB - IJCSE, Indore, INDIA
SP - 224-231
IS - 9
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
1069 415 downloads 260 downloads
  
  
           

Abstract

A Graph has two main components: 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 the 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 paper describes implementation of Steiner point on graph with number of vertices as 3, 4, 5 and 6. The presented work can be extended for graph with any number of vertices. It is an optimization approach to reduce the cable size and cost of network implementation.

Key-Words / Index Term

Graph, Network, Cable length, Steiner point, data structures

References

[1] Germander Soothill (April 27, 2010). The Euclidean Steiner Problem.
[2] Marshall W. Bern and Ronald L. Graham (January 1989). The shortest network problem, Scientific American.
[3] E. N. Gilbert and H. O. Pollak (Volume 16 no. 1, January 1968). SIAM Journal of Applied Mathematics.
[4] M.B.Chandak, R.Dharaskar, “Natural Language processing based context sensitive, content specific architecture and its speech based implementation for smart homes, International Journal of Smart homes, 4(2), 1-10, 2010.
[5] F.Riaz, K.M.Ali, “Application of graph theory in Computer Science” Third International Conference on Computational Intelligence, Communication Systems and Networks.
[6] H.Selim, P.Chopade, “Structural analysis and interactive visualization of large scale big data networks” IEEE 11th International Conference on Networking, Sensing and Control.
[7] N.Lakshmi Prasanna, “Application of Graph labelling in communication networks” Oriental Journal of Computer Science and Technology” ISSN-09724-6471
[8] Dr. S.M. Hegde, “Labeled graphs and Digraphs: Theory and Applications”, 12-01-2012 Research Promotion Workshop on IGGA
[9] http://www.britinaca.com/bps/additionalcontent/18/3 3373769/concepts-of-graph-theory-relevant-to-Adhoc- Networks.
[10] T. Suel and J. Yuan. Compressing the graph structure of the web. In Proceedings of the IEEE Data Compression Conference, 2001.
[11] Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001), "Section 22.1: Representations of graphs", Introduction to Algorithms (Second ed.), MIT Press and McGraw-Hill, pp. 527–531, ISBN 0-262-03293-7
[12] Balakrishnan, V. K. (1997-02-01). Graph Theory (1st ed.). McGraw-Hill. ISBN 0-07-005489-4.
[13] Svetlin Nakov, Fundamentals of Computer Programming with C#