%0 Generic %1 singh2014linear %A Singh, Awadhesh Kumar %A Negi, Ashish %A Kumar, Manish %A Rathee, Vivek %A and, %A Sharma, Bharti %B Int. Conf. on Recent Trends in Information, Telecommunication and Computing , ITC %D 2014 %I ACEEE (A Computer division of IDES) %K ad graph hoc network spanning tree %T On the Linear Time Construction of Minimum Spanning Tree %X T he article presents a simple algorithm to construct minimum spanning tree and to find shortest path between pair of vertices in a graph. Our illustration includes the proof of termination. The complexity analysis an d simulation results have also been included.

@conference{singh2014linear, abstract = {T he article presents a simple algorithm to construct minimum spanning tree and to find shortest path between pair of vertices in a graph. Our illustration includes the proof of termination. The complexity analysis an d simulation results have also been included.}, added-at = {2014-03-21T10:40:01.000+0100}, author = {Singh, Awadhesh Kumar and Negi, Ashish and Kumar, Manish and Rathee, Vivek and and and Sharma, Bharti}, biburl = {https://www.bibsonomy.org/bibtex/290fbbd6f4dc844aa4534fd5375a37bfa/idescitation}, booktitle = { Int. Conf. on Recent Trends in Information, Telecommunication and Computing , ITC}, interhash = {a1529093b17524f60a73bf6f0cdd03d3}, intrahash = {90fbbd6f4dc844aa4534fd5375a37bfa}, keywords = {ad graph hoc network spanning tree}, organization = {Institute of Doctors Engineers and Scientists}, publisher = {ACEEE (A Computer division of IDES)}, timestamp = {2014-03-21T10:40:01.000+0100}, title = {On the Linear Time Construction of Minimum Spanning Tree}, year = 2014 }