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

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3378-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3379-C

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Cole, Richard, Author
Farach-Colton, Martin, Author
Hariharan, Ramesh¹, Author
Przytycka, Teresa, Author
Thorup, Mikkel¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 2000

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 518226
URI: http://epubs.siam.org/sam-bin/getfile/SICOMP/articles/31347.pdf
Other: Local-ID: C1256428004B93B8-7FB9DBD953ABAAFDC1256D2100333ABB-ColeFarachetal2000

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 30 (5) Sequence Number: - Start / End Page: 1385 - 1404 Identifier: ISSN: 0097-5397