Finding the maximum common subgraph of a partial ::::k::::-tree and a graph with a polynomially bounded number of spanning trees

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. [doi]

Abstract

Abstract is missing.