default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of the Maximum Common Subgraph Problem for Partial ..."

Tatsuya Akutsu, Takeyuki Tamura (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-35261-4_18

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/isaac/AkutsuT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/AkutsuT12
Tatsuya Akutsu, Takeyuki Tamura:
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. ISAAC 2012: 146-155

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.