Keyword : largest common subgraph

A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree
Tatsuya AKUTSU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/09/25
Vol. E76-A  No. 9 ; pp. 1488-1493
Type of Manuscript:  PAPER
Category: Algorithms, Data Structures and Computational Complexity
largest common subgraphsubgraph isomorphismalmost treesNP-complete
 Summary | Full Text:PDF(397.7KB)