"An O(nlog n) Algorithm for the Maximum Agreement ..."

Richard Cole et al. (2000)

> Home

Details and statistics

DOI: 10.1137/S0097539796313477

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ColeFHPT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ColeFHPT00
Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup:
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput. 30(5): 1385-1404 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.