BibTeX record journals/algorithmica/MonmaPSY90

download as .bib file

@article{DBLP:journals/algorithmica/MonmaPSY90,
  author       = {Clyde L. Monma and
                  Mike Paterson and
                  Subhash Suri and
                  F. Frances Yao},
  title        = {Computing Euclidean Maximum Spanning Trees},
  journal      = {Algorithmica},
  volume       = {5},
  number       = {3},
  pages        = {407--419},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF01840396},
  doi          = {10.1007/BF01840396},
  timestamp    = {Wed, 17 May 2017 14:25:12 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MonmaPSY90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics