An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs
Many algorithms exist to deal with the problem of graph isomorphism, but most of the contemporary algorithms like VF2 have a bad performance for identifying isomorphism of disconnected graphs. In this paper, we propose a method that can filter and remove single vertices so as to eliminate the depend...
Gespeichert in:
| Veröffentlicht in: | Circuits, systems, and signal processing systems, and signal processing, 2013-10, Vol.32 (5), p.2469-2473 |
|---|---|
| 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 | 2473 |
|---|---|
| container_issue | 5 |
| container_start_page | 2469 |
| container_title | Circuits, systems, and signal processing |
| container_volume | 32 |
| creator | Shang, Huiliang Gao, Yuan Zhu, Jiajun |
| description | Many algorithms exist to deal with the problem of graph isomorphism, but most of the contemporary algorithms like VF2 have a bad performance for identifying isomorphism of disconnected graphs. In this paper, we propose a method that can filter and remove single vertices so as to eliminate the dependence of the relationship between all vertices which causes the loss of effectiveness. Tests on disconnected graphs demonstrate that this method can solve the problem of identifying isomorphic disconnected graphs in polynomial time. |
| doi_str_mv | 10.1007/s00034-013-9587-2 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1439729400</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1439729400</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-1d5fd6933e49c9a310bc3a6d02469b6ec1d035bde375d7bc652f5e2f1fd8e833</originalsourceid><addsrcrecordid>eNp1kMtKAzEUhoMoWKsP4C7gxk00l7llWarWQqULu3AXZnJxUjqTMcks9OlNGRciuDoczvf_HD4Argm-IxiX9wFjzDKECUM8r0pET8CM5IygtFSnYIZpWSFckbdzcBHCHmPCM05nQCx6uB2i7eyXVnBpvRxthK-2Gw91tK6HLzq2TkHjPIythmul-2iNldPVGbgOrnN-aK2EDzZI1_daxtS18vXQhktwZupD0Fc_cw52T4-75TPabFfr5WKDJMt4RETlRhWcMZ1xyWtGcCNZXShMs4I3hZZEYZY3SrMyV2Uji5yaXFNDjKp0xdgc3E61g3cfow5RdOkXfTjUvXZjECRjvKQ8S5Lm4OYPunej79NziaIV5bzEPFFkoqR3IXhtxOBtV_tPQbA4GheTcZGMi6NxQVOGTpmQ2P5d-1_N_4a-AX5ng_w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1428299709</pqid></control><display><type>article</type><title>An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs</title><source>SpringerNature Journals</source><creator>Shang, Huiliang ; Gao, Yuan ; Zhu, Jiajun</creator><creatorcontrib>Shang, Huiliang ; Gao, Yuan ; Zhu, Jiajun</creatorcontrib><description>Many algorithms exist to deal with the problem of graph isomorphism, but most of the contemporary algorithms like VF2 have a bad performance for identifying isomorphism of disconnected graphs. In this paper, we propose a method that can filter and remove single vertices so as to eliminate the dependence of the relationship between all vertices which causes the loss of effectiveness. Tests on disconnected graphs demonstrate that this method can solve the problem of identifying isomorphic disconnected graphs in polynomial time.</description><identifier>ISSN: 0278-081X</identifier><identifier>EISSN: 1531-5878</identifier><identifier>DOI: 10.1007/s00034-013-9587-2</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Circuits ; Circuits and Systems ; Computer simulation ; Disengaging ; Electrical Engineering ; Electronics and Microelectronics ; Engineering ; Graphs ; Instrumentation ; Isomorphism ; Polynomials ; Short Paper ; Signal processing ; Signal,Image and Speech Processing</subject><ispartof>Circuits, systems, and signal processing, 2013-10, Vol.32 (5), p.2469-2473</ispartof><rights>Springer Science+Business Media New York 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-1d5fd6933e49c9a310bc3a6d02469b6ec1d035bde375d7bc652f5e2f1fd8e833</citedby><cites>FETCH-LOGICAL-c349t-1d5fd6933e49c9a310bc3a6d02469b6ec1d035bde375d7bc652f5e2f1fd8e833</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00034-013-9587-2$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00034-013-9587-2$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>315,781,785,27929,27930,41493,42562,51324</link.rule.ids></links><search><creatorcontrib>Shang, Huiliang</creatorcontrib><creatorcontrib>Gao, Yuan</creatorcontrib><creatorcontrib>Zhu, Jiajun</creatorcontrib><title>An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs</title><title>Circuits, systems, and signal processing</title><addtitle>Circuits Syst Signal Process</addtitle><description>Many algorithms exist to deal with the problem of graph isomorphism, but most of the contemporary algorithms like VF2 have a bad performance for identifying isomorphism of disconnected graphs. In this paper, we propose a method that can filter and remove single vertices so as to eliminate the dependence of the relationship between all vertices which causes the loss of effectiveness. Tests on disconnected graphs demonstrate that this method can solve the problem of identifying isomorphic disconnected graphs in polynomial time.</description><subject>Algorithms</subject><subject>Circuits</subject><subject>Circuits and Systems</subject><subject>Computer simulation</subject><subject>Disengaging</subject><subject>Electrical Engineering</subject><subject>Electronics and Microelectronics</subject><subject>Engineering</subject><subject>Graphs</subject><subject>Instrumentation</subject><subject>Isomorphism</subject><subject>Polynomials</subject><subject>Short Paper</subject><subject>Signal processing</subject><subject>Signal,Image and Speech Processing</subject><issn>0278-081X</issn><issn>1531-5878</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kMtKAzEUhoMoWKsP4C7gxk00l7llWarWQqULu3AXZnJxUjqTMcks9OlNGRciuDoczvf_HD4Argm-IxiX9wFjzDKECUM8r0pET8CM5IygtFSnYIZpWSFckbdzcBHCHmPCM05nQCx6uB2i7eyXVnBpvRxthK-2Gw91tK6HLzq2TkHjPIythmul-2iNldPVGbgOrnN-aK2EDzZI1_daxtS18vXQhktwZupD0Fc_cw52T4-75TPabFfr5WKDJMt4RETlRhWcMZ1xyWtGcCNZXShMs4I3hZZEYZY3SrMyV2Uji5yaXFNDjKp0xdgc3E61g3cfow5RdOkXfTjUvXZjECRjvKQ8S5Lm4OYPunej79NziaIV5bzEPFFkoqR3IXhtxOBtV_tPQbA4GheTcZGMi6NxQVOGTpmQ2P5d-1_N_4a-AX5ng_w</recordid><startdate>20131001</startdate><enddate>20131001</enddate><creator>Shang, Huiliang</creator><creator>Gao, Yuan</creator><creator>Zhu, Jiajun</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>S0W</scope></search><sort><creationdate>20131001</creationdate><title>An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs</title><author>Shang, Huiliang ; Gao, Yuan ; Zhu, Jiajun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-1d5fd6933e49c9a310bc3a6d02469b6ec1d035bde375d7bc652f5e2f1fd8e833</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Circuits</topic><topic>Circuits and Systems</topic><topic>Computer simulation</topic><topic>Disengaging</topic><topic>Electrical Engineering</topic><topic>Electronics and Microelectronics</topic><topic>Engineering</topic><topic>Graphs</topic><topic>Instrumentation</topic><topic>Isomorphism</topic><topic>Polynomials</topic><topic>Short Paper</topic><topic>Signal processing</topic><topic>Signal,Image and Speech Processing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shang, Huiliang</creatorcontrib><creatorcontrib>Gao, Yuan</creatorcontrib><creatorcontrib>Zhu, Jiajun</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Science Database (ProQuest)</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace 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><collection>ProQuest Central Basic</collection><collection>DELNET Engineering & Technology Collection</collection><jtitle>Circuits, systems, and signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shang, Huiliang</au><au>Gao, Yuan</au><au>Zhu, Jiajun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs</atitle><jtitle>Circuits, systems, and signal processing</jtitle><stitle>Circuits Syst Signal Process</stitle><date>2013-10-01</date><risdate>2013</risdate><volume>32</volume><issue>5</issue><spage>2469</spage><epage>2473</epage><pages>2469-2473</pages><issn>0278-081X</issn><eissn>1531-5878</eissn><abstract>Many algorithms exist to deal with the problem of graph isomorphism, but most of the contemporary algorithms like VF2 have a bad performance for identifying isomorphism of disconnected graphs. In this paper, we propose a method that can filter and remove single vertices so as to eliminate the dependence of the relationship between all vertices which causes the loss of effectiveness. Tests on disconnected graphs demonstrate that this method can solve the problem of identifying isomorphic disconnected graphs in polynomial time.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s00034-013-9587-2</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0278-081X |
| ispartof | Circuits, systems, and signal processing, 2013-10, Vol.32 (5), p.2469-2473 |
| issn | 0278-081X 1531-5878 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1439729400 |
| source | SpringerNature Journals |
| subjects | Algorithms Circuits Circuits and Systems Computer simulation Disengaging Electrical Engineering Electronics and Microelectronics Engineering Graphs Instrumentation Isomorphism Polynomials Short Paper Signal processing Signal,Image and Speech Processing |
| title | An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-11T15%3A55%3A03IST&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=An%20Optimized%20Circuit%20Simulation%20Method%20for%20the%20Identification%20of%20Isomorphic%20Disconnected%20Graphs&rft.jtitle=Circuits,%20systems,%20and%20signal%20processing&rft.au=Shang,%20Huiliang&rft.date=2013-10-01&rft.volume=32&rft.issue=5&rft.spage=2469&rft.epage=2473&rft.pages=2469-2473&rft.issn=0278-081X&rft.eissn=1531-5878&rft_id=info:doi/10.1007/s00034-013-9587-2&rft_dat=%3Cproquest_cross%3E1439729400%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=1428299709&rft_id=info:pmid/&rfr_iscdi=true |