Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees
| Image |  |
|---|---|
| Description | article published in 2004 |
| Author/s |
author: Hiroshi Mamitsuka Atsuko Yamaguchi |
| Publication date | October 2004 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |