"An O(nlogn)-time algorithm for the maximum constrained agreement subtree ..."

Zeshan Peng, Hing-Fung Ting (2006)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2006.06.013

access: closed

type: Journal Article

metadata version: 2017-11-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/PengT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/PengT06
Zeshan Peng, Hing-Fung Ting:
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. Inf. Process. Lett. 100(4): 137-144 (2006)

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.