Analyzing the Largest Common Subgraph Problem in Forests
The authors present a 4-approximation algorithm for finding the largest common subgraph of two forests and propose a polynomial time approximation scheme for instances with specific conditions.