"Approximating the Maximum Isomorphic Agreement Subtree is Hard."

Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri (2000)

> Home

Details and statistics

DOI: 10.1142/S0129054100000363

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/BonizzoniVM00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/BonizzoniVM00
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
Approximating the Maximum Isomorphic Agreement Subtree is Hard. Int. J. Found. Comput. Sci. 11(4): 579-590 (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.