2026-07-18T09:37:14Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/5055 2021-12-13T04:09:49Z 1582963302567:1597824273898 user-ucsy

Content-Based Graph Matching System Using Graph Isomorphism and Sub Graph Isomorphism Algorithms Thuzar, Hla Tun, Khin Mar Lar Finding graph isomorphism and sub graphisomorphism is an important problem in manyapplications which deal with data modelled asgraphs. Graphs can represent biological networksat the molecular, protein, or species level. Animportant query is to find all matches of a patterngraph to a target graph. The goal of graphmatching is to effectively retrieve documentsrelevant to user’s queries.In this paper a graphtheoreticalformulation of a content-based graphmatching system using the graph isomorphismalgorithm and sub-graph isomorphism algorithmis presented.The proposed system retrieves the graph fromthedatabase for given the query graph. The systemis divided into two parts. First, the construction ofa graph database and representation of the objectform of graph information. Second, searching ormatching given query graph with the use of graphisomorphism algorithm and sub-graph isomorphicalgorithm to retrieve the similar graphs from thedatabase. This paper focuses on Graphrepresentation of object form and graph searchingalgorithms. 2017-12-27 http://hdl.handle.net/20.500.12678/0000005055 https://meral.edu.mm/records/5055