{'fraction_non_alphanumeric': 0.015527950310559006, 'fraction_numerical': 0.0, 'mean_word_length': 5.142857142857143, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Tree Search Based Determination of Graph Isomorphism

Graph isomorphism (GI) is a fundamental problem that commonly appears in graph-based applications, such as pattern recognition and computer vision. This paper presents a tree search based method for the determination of GI. In the proposed method, all possible sequences of a source graph are represented as all paths on a tree, and compared with an arbitrary sequence of a destination graph by an evaluation function in terms of bijectivity. Experimental results show that the proposed method is more efficient than an existing solution especially for that given two graphs are isomorphic.