@article{oai:tiu-tijc.repo.nii.ac.jp:00000028,
 author = {Chen, Hanxiong},
 journal = {研究紀要, Bulletin of Tsukuba International University},
 month = {Mar},
 note = {化学構造の検索は様々な分野で重要な意味をもつ。一方、グラフ理論では、このような検索はNP問題として証明されたグラフの部分一致判定という操作になる。グラフの部分一致判定を極力さけるために化学構造を部分順序構造(DAG)に構築して、部分一致判定を同形判定に簡単化することを提案する。本論文では同形判定の効果的なアルゴリズムを提案する。, The chemical structure searching is one of the most important subjects in many fields. On the other hand, structure searching is a graph isomorphism problem of testing subgraph, which has been proved to be NP-complete and should be avoided if possible. For this purpose, our proposal is to organize the chemical structure by pre-processing to a semi-order structure (a DAG, Directed Acyclic Graph), where each chemical structure has all its sub-structures as its super nodes in the DAG. With this DAG, subgraph searching is simplified to exact graph determination. When a graph is found to be isomorphic to the query graph, then the sub-DAG rooted at the found graph is the answer to the query. In this paper, we propose an improved polynomial-time algorithm for the graph isomorphism problem., 7, KJ00004010956, P},
 pages = {37--47},
 title = {An Isomorphism Algorithm for Chemical Graph Searching},
 volume = {2},
 year = {1996}
}