File Download

There are no files associated with this item.

Supplementary

Conference Paper: An O(nlogn)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees

TitleAn O(nlogn)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees
Authors
Peng, ZTing, HF
Issue Date2004
Citation
Proceedings of the 15th Annual International Symposium on Algorithms and Computation, p. 754-765 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/93273

 

DC FieldValueLanguage
dc.contributor.authorPeng, Zen_HK
dc.contributor.authorTing, HFen_HK
dc.date.accessioned2010-09-25T14:56:07Z-
dc.date.available2010-09-25T14:56:07Z-
dc.date.issued2004en_HK
dc.identifier.citationProceedings of the 15th Annual International Symposium on Algorithms and Computation, p. 754-765en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93273-
dc.languageengen_HK
dc.relation.ispartofProceedings of the 15th Annual International Symposium on Algorithms and Computationen_HK
dc.titleAn O(nlogn)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Treesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailPeng, Z: zspeng@cs.hku.hken_HK
dc.identifier.emailTing, HF: hfting@cs.hku.hken_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.identifier.hkuros109465en_HK
dc.identifier.spage754en_HK
dc.identifier.epage765en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats