{"id":"https://openalex.org/W2013054747","doi":"https://doi.org/10.1137/0209025","title":"A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem","display_name":"A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem","publication_year":1980,"publication_date":"1980-05-01","ids":{"openalex":"https://openalex.org/W2013054747","doi":"https://doi.org/10.1137/0209025","mag":"2013054747"},"language":"en","primary_location":{"id":"doi:10.1137/0209025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209025","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055875227","display_name":"Derek G. Corneil","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D. G. Corneil","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069172477","display_name":"David Kirkpatrick","orcid":"https://orcid.org/0000-0002-3276-2734"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. G. Kirkpatrick","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055875227"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0929,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.75705577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"2","first_page":"281","last_page":"297"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.8915753364562988},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7373582124710083},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6654806137084961},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.6359948515892029},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.6026899814605713},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5896616578102112},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4828551411628723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4825719892978668},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4822467267513275},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44535520672798157},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44159233570098877},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4369915723800659},{"id":"https://openalex.org/keywords/graph-automorphism","display_name":"Graph automorphism","score":0.42634421586990356},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.4133464992046356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3850591778755188},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3726661801338196},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30802273750305176},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21985787153244019},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15409386157989502},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07354483008384705}],"concepts":[{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.8915753364562988},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7373582124710083},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6654806137084961},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.6359948515892029},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.6026899814605713},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5896616578102112},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4828551411628723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4825719892978668},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4822467267513275},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44535520672798157},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44159233570098877},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4369915723800659},{"id":"https://openalex.org/C6049932","wikidata":"https://www.wikidata.org/wiki/Q834981","display_name":"Graph automorphism","level":5,"score":0.42634421586990356},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4133464992046356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3850591778755188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3726661801338196},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30802273750305176},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21985787153244019},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15409386157989502},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07354483008384705},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0209025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209025","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W177804185","https://openalex.org/W1511255594","https://openalex.org/W1655990431","https://openalex.org/W1977464943","https://openalex.org/W2009232680","https://openalex.org/W2024491681","https://openalex.org/W2030087828","https://openalex.org/W2030681981","https://openalex.org/W2035541633","https://openalex.org/W2045664183","https://openalex.org/W2048172960","https://openalex.org/W2050426110","https://openalex.org/W2073067110","https://openalex.org/W2095052098","https://openalex.org/W2122493035","https://openalex.org/W2154878346","https://openalex.org/W4213214460","https://openalex.org/W4312774231","https://openalex.org/W4312994221"],"related_works":["https://openalex.org/W1900138702","https://openalex.org/W2991205486","https://openalex.org/W88519367","https://openalex.org/W1988965627","https://openalex.org/W2017265236","https://openalex.org/W97105127","https://openalex.org/W1856194915","https://openalex.org/W2548031667","https://openalex.org/W2109056537","https://openalex.org/W1808196232"],"abstract_inverted_index":{"The":[0],"graph":[1],"isomorphism":[2,118,136,140,151],"problem":[3,16,141],"has":[4,35,69],"received":[5],"considerable":[6],"attention":[7],"due":[8],"to":[9,112,134,148],"the":[10,15,28,38,91,108,139,149],"many":[11],"practical":[12,25],"applications":[13],"of":[14,27,33,40,96,105,124,130],"and":[17],"its":[18],"unresolved":[19],"complexity":[20],"status.":[21],"To":[22],"deal":[23,32],"with":[24],"instances":[26],"problem,":[29],"a":[30,103,122],"great":[31],"effort":[34],"gone":[36],"into":[37],"development":[39],"seemingly":[41],"quite":[42],"effective":[43],"heuristic":[44],"algorithms":[45,48],"Typically,":[46],"these":[47,58,125,143],"exploit":[49],"various":[50],"vertex":[51,85,109],"properties":[52],"which":[53],"are":[54,87,132],"invariant":[55,110],"under":[56],"isomorphism.Empirically,":[57],"heuristics":[59],"have":[60],"been":[61,70],"analyzed":[62],"extensively;":[63],"however,":[64],"very":[65],"little":[66],"theoretical":[67],"analysis":[68],"done":[71],"on":[72,142],"their":[73],"intrinsic":[74],"value.":[75],"In":[76],"this":[77],"paper":[78],"we":[79],"show":[80],"that":[81,93],"most":[82],"commonly":[83],"used":[84],"invariants":[86],"theoretically":[88],"ineffective":[89],"in":[90],"sense":[92],"any":[94,114],"pair":[95,104],"graphs":[97,106,131,144],"may":[98],"be":[99,135],"uniquely":[100],"represented":[101],"by":[102],"where":[107],"fails":[111],"give":[113],"information":[115],"whatsoever":[116],"about":[117],"or":[119],"nonisomorphism.":[120],"As":[121],"byproduct":[123],"results,":[126],"new":[127],"restricted":[128],"families":[129],"shown":[133],"complete":[137],"(i.e.,":[138],"is":[145],"polynomial-time":[146],"equivalent":[147],"general":[150],"problem).":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}