Fundraising September 15, 2024 – October 1, 2024 About fundraising

An O ( n...

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
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
30
Language:
english
Journal:
SIAM Journal on Computing
DOI:
10.1137/s0097539796313477
Date:
January, 2000
File:
PDF, 238 KB
english, 2000
Conversion to is in progress
Conversion to is failed