BibTeX record journals/rsa/McDiarmidJS97

download as .bib file

@article{DBLP:journals/rsa/McDiarmidJS97,
  author    = {Colin McDiarmid and
               Theodore Johnson and
               Harold S. Stone},
  title     = {On finding a minimum spanning tree in a network with random weights},
  journal   = {Random Struct. Algorithms},
  volume    = {10},
  number    = {1-2},
  pages     = {187--204},
  year      = {1997},
  url       = {http://dx.doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2<187::AID-RSA10>3.0.CO;2-6},
  doi       = {10.1002/(SICI)1098-2418(199701/03)10:1/2<187::AID-RSA10>3.0.CO;2-6},
  timestamp = {Tue, 09 Aug 2016 15:46:31 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/rsa/McDiarmidJS97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}