References

Bern, M.W. and R.L. Graham, 1989. The shortest-network problem. Sci. Am., 260: 84-89.
CrossRef  |  Direct Link  |  

Chandak, M.B. and R. Dharaskar, 2010. Natural language processing based context sensitive, content specific architecture and its speech based implementation for smart home applications. Intl. J. Smart Home, 4: 1-10.
Direct Link  |  

Gilbert, E.N. and H.O. Pollak, 1968. Steiner minimal trees. SIAM. J. Appl. Math., 16: 1-29.
Direct Link  |  

Prasanna, N.L., 2017. Application of graph labelling in communication networks. Orient. J. Comput. Sci. Technol., Vol. 7,

Riaz, F. and K.M. Ali, 2011. Applications of graph theory in computer science. Proceedings of the 2011 3rd International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN’11), July 26-28, 2011, IEEE, Bali, Indonesia, ISBN:978-1-4577-0975-3, pp: 142-145.

Soothill, G., 2010. The euclidean steiner problem. M.Sc. Thesis, Department of Mathematical Science, Durham University, England.

Suel, T. and J. Yuan, 2001. Compressing the graph structure of the web. Proceedings of the 2001 Conference on Data Compression (DCC’01), March 27-29, 2001, IEEE, Snowbird, USA., pp: 213-222.