Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand. Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1814-1832, SIAM, 2013. [doi]
@inproceedings{BrodalFMPS13,
title = {Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree},
author = {Gerth Stølting Brodal and Rolf Fagerberg and Thomas Mailund and Christian N. S. Pedersen and Andreas Sand},
year = {2013},
url = {http://knowledgecenter.siam.org/0236-000098/},
researchr = {https://researchr.org/publication/BrodalFMPS13},
cites = {0},
citedby = {0},
pages = {1814-1832},
booktitle = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013},
editor = {Sanjeev Khanna},
publisher = {SIAM},
}