@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:36:31.000+0100},
  author = {Singh, Awadhesh Kumar and Negi, Ashish and Kumar, Manish and Rathee, Vivek and and and Sharma, Bharti},
  biburl = {http://www.bibsonomy.org/bibtex/2766f86eb8d512d9ca97e575c0f24f9c2/idescitation},
  booktitle = {graph spanning tree ad hoc network},
  interhash = {a1529093b17524f60a73bf6f0cdd03d3},
  intrahash = {766f86eb8d512d9ca97e575c0f24f9c2},
  keywords = {ad spanning hoc tree network graph},
  organization = {Institute of Doctors Engineers and Scientists},
  timestamp = {2014-03-21T10:36:31.000+0100},
  title = {On the Linear Time Construction of Minimum Spanning Tree},
  url = {http://searchdl.org/public/conference/2014/ITC/15.pdf},
  year = 2014
}

{"_id":"aMndqk3RqQ84bgrAA","bibbaseid":"singh-negi-kumar-rathee---sharma-onthelineartimeconstructionofminimumspanningtree-2014","downloads":0,"creationDate":"2016-02-09T06:00:33.479Z","title":"On the Linear Time Construction of Minimum Spanning Tree","author_short":["Singh, A. K.","Negi, A.","Kumar, M.","Rathee, V.","","","Sharma, B."],"year":2014,"bibtype":"conference","biburl":"http://www.bibsonomy.org/bib/author/Vivek Krishnakumar?items=1000","bibdata":{"bibtype":"conference","type":"conference","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:36:31.000+0100","author":[{"propositions":[],"lastnames":["Singh"],"firstnames":["Awadhesh","Kumar"],"suffixes":[]},{"propositions":[],"lastnames":["Negi"],"firstnames":["Ashish"],"suffixes":[]},{"propositions":[],"lastnames":["Kumar"],"firstnames":["Manish"],"suffixes":[]},{"propositions":[],"lastnames":["Rathee"],"firstnames":["Vivek"],"suffixes":[]},{"firstnames":[],"propositions":[],"lastnames":[""],"suffixes":[]},{"firstnames":[],"propositions":[],"lastnames":[""],"suffixes":[]},{"propositions":[],"lastnames":["Sharma"],"firstnames":["Bharti"],"suffixes":[]}],"biburl":"http://www.bibsonomy.org/bibtex/2766f86eb8d512d9ca97e575c0f24f9c2/idescitation","booktitle":"graph spanning tree ad hoc network","interhash":"a1529093b17524f60a73bf6f0cdd03d3","intrahash":"766f86eb8d512d9ca97e575c0f24f9c2","keywords":"ad spanning hoc tree network graph","organization":"Institute of Doctors Engineers and Scientists","timestamp":"2014-03-21T10:36:31.000+0100","title":"On the Linear Time Construction of Minimum Spanning Tree","url":"http://searchdl.org/public/conference/2014/ITC/15.pdf","year":"2014","bibtex":"@conference{singh2014linear,\n abstract = {T\r\nhe article presents a simple algorithm to construct\r\nminimum spanning tree\r\nand\r\nto find shortest path between pair of vertices in a graph. Our illustration includes the proof\r\nof termination. The complexity analysis an\r\nd simulation results have also been included},\n added-at = {2014-03-21T10:36:31.000+0100},\n author = {Singh, Awadhesh Kumar and Negi, Ashish and Kumar, Manish and Rathee, Vivek and and and Sharma, Bharti},\n biburl = {http://www.bibsonomy.org/bibtex/2766f86eb8d512d9ca97e575c0f24f9c2/idescitation},\n booktitle = {graph spanning tree ad hoc network},\n interhash = {a1529093b17524f60a73bf6f0cdd03d3},\n intrahash = {766f86eb8d512d9ca97e575c0f24f9c2},\n keywords = {ad spanning hoc tree network graph},\n organization = {Institute of Doctors Engineers and Scientists},\n timestamp = {2014-03-21T10:36:31.000+0100},\n title = {On the Linear Time Construction of Minimum Spanning Tree},\n url = {http://searchdl.org/public/conference/2014/ITC/15.pdf},\n year = 2014\n}\n\n","author_short":["Singh, A. K.","Negi, A.","Kumar, M.","Rathee, V.","","","Sharma, B."],"key":"singh2014linear","id":"singh2014linear","bibbaseid":"singh-negi-kumar-rathee---sharma-onthelineartimeconstructionofminimumspanningtree-2014","role":"author","urls":{"Paper":"http://searchdl.org/public/conference/2014/ITC/15.pdf"},"keyword":["ad spanning hoc tree network graph"],"downloads":0},"search_terms":["linear","time","construction","minimum","spanning","tree","singh","negi","kumar","rathee","","","sharma"],"keywords":["ad spanning hoc tree network graph"],"authorIDs":[],"dataSources":["MhetGwzdnqQv3dJWT"]}