Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 Bryant99
%A Bryant, D.
%A Moulton, V.
%D 1999
%J Appl. Math. Lett.
%K from:davidjamesbryant
%N 2
%P 51--56
%T A polynomial time algorithm for constructing the refined Buneman tree
%V 12
@article{Bryant99,
added-at = {2009-01-28T01:17:14.000+0100},
author = {Bryant, D. and Moulton, V.},
biburl = {https://www.bibsonomy.org/bibtex/2f3d4feeb7aa62feb8aad6be70b43801e/compevol},
coden = {AMLEEL},
date-added = {2009-01-28 12:07:05 +1300},
date-modified = {2009-01-28 13:04:38 +1300},
fjournal = {Applied Mathematics Letters. An International Journal of Rapid Publication},
interhash = {59e723dffb03b910a538b909888a9871},
intrahash = {f3d4feeb7aa62feb8aad6be70b43801e},
issn = {0893-9659},
journal = {Appl. Math. Lett.},
keywords = {from:davidjamesbryant},
mrclass = {92D15 (68W05)},
mrnumber = {MR1749763 (2000k:92014)},
number = 2,
pages = {51--56},
timestamp = {2009-01-28T01:29:25.000+0100},
title = {A polynomial time algorithm for constructing the refined {B}uneman tree},
volume = 12,
year = 1999
}
