Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • MERAL
  • Universities
  • Ranking
AND
To


Index Link

Index Tree

WEKO

One fine body…

Item

{"_buckets": {"deposit": "b6ba9e83-5dbb-4110-8173-9cdb5862df1d"}, "_deposit": {"id": "5055", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "5055"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/5055"}, "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Content-Based Graph Matching System Using Graph Isomorphism and Sub Graph Isomorphism Algorithms", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "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\u2019s 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."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_name_i18n": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-18"}], "displaytype": "preview", "download_preview_message": "", "filename": "51_PDFsam_PSC_final proof.pdf", "filesize": [{"value": "244 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 244000, "url": {"url": "https://meral.edu.mm/record/5055/files/51_PDFsam_PSC_final proof.pdf"}, "version_id": "d60956fb-d992-4ab0-b38e-ec7237821eba"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eighth Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Thuzar, Hla"}, {"subitem_authors_fullname": "Tun, Khin Mar Lar"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_name_i18n": "Upload type", "attribute_value": "Publication"}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_name_i18n": "Publication type", "attribute_value": "Article"}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_name_i18n": "Publication date", "attribute_value": "2017-12-27"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/948"}, "item_title": "Content-Based Graph Matching System Using Graph Isomorphism and Sub Graph Isomorphism Algorithms", "item_type_id": "21", "owner": "1", "path": ["1582963302567/1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000005055", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-18"}, "publish_date": "2019-07-18", "publish_status": "0", "recid": "5055", "relation": {}, "relation_version_is_last": true, "title": ["Content-Based Graph Matching System Using Graph Isomorphism and Sub Graph Isomorphism Algorithms"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Content-Based Graph Matching System Using Graph Isomorphism and Sub Graph Isomorphism Algorithms

http://hdl.handle.net/20.500.12678/0000005055
ddbea4a1-8b89-468c-ac5a-f032f79115d4
b6ba9e83-5dbb-4110-8173-9cdb5862df1d
Preview
Name / File License Actions
51_PDFsam_PSC_final 51_PDFsam_PSC_final proof.pdf (244 Kb)
Publication type Article
Upload type Publication
Title
Content-Based Graph Matching System Using Graph Isomorphism and Sub Graph Isomorphism Algorithms
en
Publication date 2017-12-27
Authors
Thuzar, Hla
Tun, Khin Mar Lar
Description
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.
Journal articles
Eighth Local Conference on Parallel and Soft Computing
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 15:41:27.546931
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL