"An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree ..."

Zeshan Peng, Hing-Fung Ting (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-30551-4_65

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/PengT04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/PengT04
Zeshan Peng, Hing-Fung Ting:
An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. ISAAC 2004: 754-765

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.