Haibin Hu

Learn More
A new approach to the problem of graph isomorphism detection base on decision tree is proposed. It is based on the approach proposed by B. T. Messmer and H. Bunke. If the time needed for preprocessing is neglected, the computational complexity of their approach is only polynomial in the number of input graph vertices. However, the decision tree is of(More)
  • 1