A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees

出版年份 2013 全文链接

标题

作者

关键词

Binary Tree, Time Algorithm, Lower Common Ancestor, Contractible Edge, Brodal

出版物

Volume 14, Issue Suppl 2, Pages S18

出版商

Springer Nature

发表日期

2013-01-21

DOI

10.1186/1471-2105-14-s2-s18

参考文献

查看 2 条相关文献

联系作者

Explore over 38,000 international journals covering a vast array of academic fields.

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now