"On the Complexity of Finding a Largest Common Subtree of Bounded Degree."

Tatsuya Akutsu et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-40164-0_4

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/AkutsuTMT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/AkutsuTMT13
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu:
On the Complexity of Finding a Largest Common Subtree of Bounded Degree. FCT 2013: 4-15

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.