Last update: Sun Mar 31 02:50:04 MDT 2019
@Article{Feragen:2012:CCD, author = "Aasa Feragen", title = "Complexity of Computing Distances between Geometric Trees", journal = j-LECT-NOTES-COMP-SCI, volume = "7626", pages = "89--97", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-34166-3_10", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:26:06 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012k.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-34166-3_10/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-34166-3", book-URL = "http://www.springerlink.com/content/978-3-642-34166-3", fjournal = "Lecture Notes in Computer Science", }