An implementation of an algorithm for finding minimal spanning trees in a Euclidean coordinate space
Author:Jyrki Katajainen
Publication:Manual D22, Department of Computer Science, University of Turku (1981), 6 pp. 10 app.pp.
Full text:<pdf.gif>PDF (1.93 MB)  
Related:<html.gif>HTML (Technical report)  <html.gif>HTML (Journal article)  <html.gif>HTML (Thesis)  
BibLATEX:
@report{Kat1981S,
  author = {Jyrki Katajainen},
  title = {An implementation of an algorithm for finding minimal spanning trees
    in a {E}uclidean coordinate space},
  type = {Manual},
  number = {D22},
  institution = {Department of Computer Science, University of Turku},
  year = {1981},
  pagetotal = {6+10},
}
This page was generated by Jyrki Katajainen <jyrki@di.ku.dk> on 31.12.2011.