Before revision:  Graph similarity computation for metrics such as Graph Edit Distance (GED) is typically NP-hard , and existing heuristics-based algorithms usually achieves a unsatisfactory trade-off between accuracy and efficiency.
After revision:  Graph similarity computation for metrics such as Graph Edit Distance (GED) is typically NP-hard problem and traditional algorithms usually achieve an unsatisfactory trade-off between accuracy and efficiency.