An O(n log n) algorithm for the maximum agreement subtree problem for binary 
trees

Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

An O(n log n) algorithm for the maximum agreement subtree problem for binary trees

MPS-Authors

/persons/resource/persons44586

Hariharan, Ramesh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45619

Thorup, Mikkel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., & Thorup, M. (2000). An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing, 30(5), 1385-1404. Retrieved from http://epubs.siam.org/sam-bin/getfile/SICOMP/articles/31347.pdf.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-3378-E

要旨

要旨はありません