"Maximum Agreement Subtree (of 2 Binary Trees)."

Ramesh Hariharan (2008)

> Home

Details and statistics

DOI: 10.1007/978-0-387-30162-4_220

access: closed

type: Reference Work

metadata version: 2017-07-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - reference/algo/Hariharan08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/reference/algo/Hariharan08
Ramesh Hariharan:
Maximum Agreement Subtree (of 2 Binary Trees). Encyclopedia of Algorithms 2008

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.