Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Finding the maximum common subgraph of a partial k-tree and a graph ..."

Atsuko Yamaguchi, Kiyoko F. Aoki, Hiroshi Mamitsuka (2004)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2004.06.019

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/YamaguchiAM04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/YamaguchiAM04
Atsuko Yamaguchi, Kiyoko F. Aoki, Hiroshi Mamitsuka:
Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. Inf. Process. Lett. 92(2): 57-63 (2004)

a service of

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.