Zeshan Peng, Hing-Fung Ting. An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. In Rudolf Fleischer, Gerhard Trippen, editors, Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings. Volume 3341 of Lecture Notes in Computer Science, pages 754-765, Springer, 2004. [doi]
@inproceedings{PengT04,
title = {An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees},
author = {Zeshan Peng and Hing-Fung Ting},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3341&spage=754},
researchr = {https://researchr.org/publication/PengT04},
cites = {0},
citedby = {0},
pages = {754-765},
booktitle = {Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings},
editor = {Rudolf Fleischer and Gerhard Trippen},
volume = {3341},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24131-0},
}