A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform
Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task...
Gespeichert in:
| Veröffentlicht in: | Applied Mechanics and Materials 2014-02, Vol.513-517 (Applied Science, Materials Science and Information Technologies in Industry), p.483-486 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 486 |
|---|---|
| container_issue | Applied Science, Materials Science and Information Technologies in Industry |
| container_start_page | 483 |
| container_title | Applied Mechanics and Materials |
| container_volume | 513-517 |
| creator | Tian, Wei Xin Yuan, Long |
| description | Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task over multi-core platforms. The algorithm sorts the vertices of the two graphs by the the degree of outedge and inedge, then adds all the vertices to the feasible pair according to the connection relations of the current vertex. All the tasks distributed among the multi-cores share the same memory. The experiment shows that it has the better performance than current algorithm as the edges increase. |
| doi_str_mv | 10.4028/www.scientific.net/AMM.513-517.483 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1762083022</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1762083022</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-4f12d53b30e426c24c9e78aa86e8220288a5b69d595165c76ee1256dacad24993</originalsourceid><addsrcrecordid>eNqNkE1LAzEQhoMfoNb-hwUvIuya783erPWrYLGgnkOaZtst2U1NshT_vdEKiicPwxzm5ZmZB4ALBAsKsbjcbrdF0I3pYlM3uuhMvBxNpwVDJGeoLKgge-AYcY7zkgq8D4ZVKQgkgjCIMDv4msG8IoQfgZMQ1hByiqg4BlejbKa8stbY7LmfL73arLJJcK3zm1UT2mxkl843cdVmrsumvY1NPnbeZDOrYu18ewoOa2WDGX73AXi9u30ZP-SPT_eT8egx12lpzGmN8IKROYGGYq4x1ZUphVKCG4FxelEoNufVglUMcaZLbkw6nC-UVgtMq4oMwPmOu_HurTchyrYJ2lirOuP6IFHJMUw_Y5yiZ3-ia9f7Ll2XUqiCiJXiE3i9S2nvQvCmlhvftMq_SwTlp3SZpMsf6TJJl0m6TNJTlTJJT5CbHSR61YVo9OrXrv9jPgDOq5Ck</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1719015789</pqid></control><display><type>article</type><title>A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform</title><source>Scientific.net Journals</source><creator>Tian, Wei Xin ; Yuan, Long</creator><creatorcontrib>Tian, Wei Xin ; Yuan, Long</creatorcontrib><description>Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task over multi-core platforms. The algorithm sorts the vertices of the two graphs by the the degree of outedge and inedge, then adds all the vertices to the feasible pair according to the connection relations of the current vertex. All the tasks distributed among the multi-cores share the same memory. The experiment shows that it has the better performance than current algorithm as the edges increase.</description><identifier>ISSN: 1660-9336</identifier><identifier>ISSN: 1662-7482</identifier><identifier>ISBN: 9783038350125</identifier><identifier>ISBN: 3038350125</identifier><identifier>EISSN: 1662-7482</identifier><identifier>DOI: 10.4028/www.scientific.net/AMM.513-517.483</identifier><language>eng</language><publisher>Zurich: Trans Tech Publications Ltd</publisher><subject>Algorithms ; Cost engineering ; Graph theory ; Graphs ; Isomorphism ; Platforms ; Strategy ; Tasks</subject><ispartof>Applied Mechanics and Materials, 2014-02, Vol.513-517 (Applied Science, Materials Science and Information Technologies in Industry), p.483-486</ispartof><rights>2014 Trans Tech Publications Ltd</rights><rights>Copyright Trans Tech Publications Ltd. Feb 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c336t-4f12d53b30e426c24c9e78aa86e8220288a5b69d595165c76ee1256dacad24993</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://www.scientific.net/Image/TitleCover/2987?width=600</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>Tian, Wei Xin</creatorcontrib><creatorcontrib>Yuan, Long</creatorcontrib><title>A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform</title><title>Applied Mechanics and Materials</title><description>Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task over multi-core platforms. The algorithm sorts the vertices of the two graphs by the the degree of outedge and inedge, then adds all the vertices to the feasible pair according to the connection relations of the current vertex. All the tasks distributed among the multi-cores share the same memory. The experiment shows that it has the better performance than current algorithm as the edges increase.</description><subject>Algorithms</subject><subject>Cost engineering</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Isomorphism</subject><subject>Platforms</subject><subject>Strategy</subject><subject>Tasks</subject><issn>1660-9336</issn><issn>1662-7482</issn><issn>1662-7482</issn><isbn>9783038350125</isbn><isbn>3038350125</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNkE1LAzEQhoMfoNb-hwUvIuya783erPWrYLGgnkOaZtst2U1NshT_vdEKiicPwxzm5ZmZB4ALBAsKsbjcbrdF0I3pYlM3uuhMvBxNpwVDJGeoLKgge-AYcY7zkgq8D4ZVKQgkgjCIMDv4msG8IoQfgZMQ1hByiqg4BlejbKa8stbY7LmfL73arLJJcK3zm1UT2mxkl843cdVmrsumvY1NPnbeZDOrYu18ewoOa2WDGX73AXi9u30ZP-SPT_eT8egx12lpzGmN8IKROYGGYq4x1ZUphVKCG4FxelEoNufVglUMcaZLbkw6nC-UVgtMq4oMwPmOu_HurTchyrYJ2lirOuP6IFHJMUw_Y5yiZ3-ia9f7Ll2XUqiCiJXiE3i9S2nvQvCmlhvftMq_SwTlp3SZpMsf6TJJl0m6TNJTlTJJT5CbHSR61YVo9OrXrv9jPgDOq5Ck</recordid><startdate>20140206</startdate><enddate>20140206</enddate><creator>Tian, Wei Xin</creator><creator>Yuan, Long</creator><general>Trans Tech Publications Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SR</scope><scope>7TB</scope><scope>8BQ</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>BENPR</scope><scope>BFMQW</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>KB.</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>PDBOC</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20140206</creationdate><title>A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform</title><author>Tian, Wei Xin ; Yuan, Long</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-4f12d53b30e426c24c9e78aa86e8220288a5b69d595165c76ee1256dacad24993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Cost engineering</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Isomorphism</topic><topic>Platforms</topic><topic>Strategy</topic><topic>Tasks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tian, Wei Xin</creatorcontrib><creatorcontrib>Yuan, Long</creatorcontrib><collection>CrossRef</collection><collection>Engineered Materials Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central</collection><collection>Continental Europe Database</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>Materials Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Materials Science Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Applied Mechanics and Materials</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tian, Wei Xin</au><au>Yuan, Long</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform</atitle><jtitle>Applied Mechanics and Materials</jtitle><date>2014-02-06</date><risdate>2014</risdate><volume>513-517</volume><issue>Applied Science, Materials Science and Information Technologies in Industry</issue><spage>483</spage><epage>486</epage><pages>483-486</pages><issn>1660-9336</issn><issn>1662-7482</issn><eissn>1662-7482</eissn><isbn>9783038350125</isbn><isbn>3038350125</isbn><abstract>Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task over multi-core platforms. The algorithm sorts the vertices of the two graphs by the the degree of outedge and inedge, then adds all the vertices to the feasible pair according to the connection relations of the current vertex. All the tasks distributed among the multi-cores share the same memory. The experiment shows that it has the better performance than current algorithm as the edges increase.</abstract><cop>Zurich</cop><pub>Trans Tech Publications Ltd</pub><doi>10.4028/www.scientific.net/AMM.513-517.483</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1660-9336 |
| ispartof | Applied Mechanics and Materials, 2014-02, Vol.513-517 (Applied Science, Materials Science and Information Technologies in Industry), p.483-486 |
| issn | 1660-9336 1662-7482 1662-7482 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1762083022 |
| source | Scientific.net Journals |
| subjects | Algorithms Cost engineering Graph theory Graphs Isomorphism Platforms Strategy Tasks |
| title | A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T08%3A25%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Parallel%20Subgraph%20Isomorphism%20Algorithm%20on%20Multi-Core%20Platform&rft.jtitle=Applied%20Mechanics%20and%20Materials&rft.au=Tian,%20Wei%20Xin&rft.date=2014-02-06&rft.volume=513-517&rft.issue=Applied%20Science,%20Materials%20Science%20and%20Information%20Technologies%20in%20Industry&rft.spage=483&rft.epage=486&rft.pages=483-486&rft.issn=1660-9336&rft.eissn=1662-7482&rft.isbn=9783038350125&rft.isbn_list=3038350125&rft_id=info:doi/10.4028/www.scientific.net/AMM.513-517.483&rft_dat=%3Cproquest_cross%3E1762083022%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1719015789&rft_id=info:pmid/&rfr_iscdi=true |