How to Find a Minimum Spanning Tree in Practice

Bernard M. E. Moret, Henry D. Shapiro. How to Find a Minimum Spanning Tree in Practice. In Hermann A. Maurer, editor, New Results and New Trends in Computer Science, Graz, Austria, June 20-21, 1991, Proceedings [on occasion of H. Maurer s 50th birthday]. Volume 555 of Lecture Notes in Computer Science, pages 192-203, Springer, 1991.

@inproceedings{MoretS91,
  title = {How to Find a Minimum Spanning Tree in Practice},
  author = {Bernard M. E. Moret and Henry D. Shapiro},
  year = {1991},
  tags = {e-science},
  researchr = {https://researchr.org/publication/MoretS91},
  cites = {0},
  citedby = {0},
  pages = {192-203},
  booktitle = {New Results and New Trends in Computer Science, Graz, Austria, June 20-21, 1991, Proceedings [on occasion of H. Maurer s 50th birthday]},
  editor = {Hermann A. Maurer},
  volume = {555},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-54869-6},
}