Missing/wrong data?
Log in to edit
Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees
article published in 2004
Author/s
author: Atsuko Yamaguchi, Hiroshi Mamitsuka
Work details
Publication date
October 2004
-
-
Language
English
Copyright status
Copyright status information is not available for this work. The copyright status depends on the jurisdiction, the author's date of death and the date the work was created or published.
To learn more about copyright terms in different countries, visit the countries and terms page.