"Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a ..."

Atsuko Yamaguchi, Hiroshi Mamitsuka (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-24587-2_8

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/YamaguchiM03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/YamaguchiM03
Atsuko Yamaguchi, Hiroshi Mamitsuka:
Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. ISAAC 2003: 58-67

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.