{"id":"https://openalex.org/W2971738761","doi":"https://doi.org/10.1145/3333250","title":"New Exact and Heuristic Algorithms for Graph Automorphism Group and Graph Isomorphism","display_name":"New Exact and Heuristic Algorithms for Graph Automorphism Group and Graph Isomorphism","publication_year":2019,"publication_date":"2019-09-05","ids":{"openalex":"https://openalex.org/W2971738761","doi":"https://doi.org/10.1145/3333250","mag":"2971738761"},"language":"en","primary_location":{"id":"doi:10.1145/3333250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3333250","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5008109559","display_name":"Stoicho D. Stoichev","orcid":"https://orcid.org/0000-0002-6217-460X"},"institutions":[{"id":"https://openalex.org/I31151848","display_name":"Technical University of Sofia","ror":"https://ror.org/052prhs50","country_code":"BG","type":"education","lineage":["https://openalex.org/I31151848"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Stoicho D. Stoichev","raw_affiliation_strings":["Technical University of Sofia, Sofia, Bulgaria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Sofia, Sofia, Bulgaria","institution_ids":["https://openalex.org/I31151848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008109559"],"corresponding_institution_ids":["https://openalex.org/I31151848"],"apc_list":null,"apc_paid":null,"fwci":1.4865,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84409537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9955999851226807,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9937000274658203,"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/algorithm","display_name":"Algorithm","score":0.706114649772644},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5495315194129944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5227944254875183},{"id":"https://openalex.org/keywords/automorphism-group","display_name":"Automorphism group","score":0.5192015767097473},{"id":"https://openalex.org/keywords/graph-automorphism","display_name":"Graph automorphism","score":0.4761350452899933},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4422883093357086},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43959206342697144},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39777255058288574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3817184567451477},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.3685912489891052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3629513382911682},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2712256908416748},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.17623475193977356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10060566663742065}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.706114649772644},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5495315194129944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5227944254875183},{"id":"https://openalex.org/C2988750069","wikidata":"https://www.wikidata.org/wiki/Q60790315","display_name":"Automorphism group","level":3,"score":0.5192015767097473},{"id":"https://openalex.org/C6049932","wikidata":"https://www.wikidata.org/wiki/Q834981","display_name":"Graph automorphism","level":5,"score":0.4761350452899933},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4422883093357086},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43959206342697144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39777255058288574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3817184567451477},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.3685912489891052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3629513382911682},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2712256908416748},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.17623475193977356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10060566663742065},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3333250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3333250","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1570131048","https://openalex.org/W1655990431","https://openalex.org/W1952494904","https://openalex.org/W1977004736","https://openalex.org/W1989114462","https://openalex.org/W1990600049","https://openalex.org/W2096704006","https://openalex.org/W2154878346","https://openalex.org/W2238639262","https://openalex.org/W2561675875","https://openalex.org/W2616240124","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1711180383","https://openalex.org/W1997883919","https://openalex.org/W1258892498","https://openalex.org/W3047524870","https://openalex.org/W2017265236","https://openalex.org/W2187958446","https://openalex.org/W1982404768","https://openalex.org/W2041670454","https://openalex.org/W2153879854","https://openalex.org/W1770199419"],"abstract_inverted_index":{"We":[0],"describe":[1],"five":[2],"new":[3,57,84,96,192],"algorithms,":[4,140],"named":[5],"Vsep.":[6],"Four":[7],"of":[8,33,44,89,120,145,149,204],"them":[9],"are":[10,37,104,166,170,181,190],"for":[11,21,52,130,143,184,194],"the":[12,17,34,41,45,49,62,69,79,90,102,121,134,146,150,173,195,201],"graph":[13,53,132],"automorphism":[14,54],"group":[15],"and":[16,73,116,141,169],"fifth":[18],"one":[19,175],"is":[20,40,59,99],"finding":[22],"an":[23],"isomorphism":[24],"between":[25],"two":[26],"graphs.":[27,186],"All":[28],"nonequivalent":[29],"terminal":[30],"nodes-discrete":[31],"partitions":[32],"search":[35,163],"tree":[36],"stored.":[38],"This":[39],"main":[42],"difference":[43],"exact":[46,63,135,168,174],"version":[47],"with":[48,118,176],"known":[50,124],"algorithms":[51,108,152,189,206],"group.":[55],"A":[56],"strategy":[58],"used":[60],"in":[61,155],"algorithm:":[64],"if":[65],"during":[66],"its":[67],"execution":[68],"computed":[70],"stabilizer":[71],"orbits":[72],"order":[74],"get":[75],"wrong":[76],"values,":[77],"then":[78],"algorithm":[80,137],"continues":[81],"from":[82],"a":[83,191,208],"starting":[85,97],"point":[86,98],"losing":[87],"some":[88,131,144],"results":[91,103,127],"determined":[92],"so":[93],"far.":[94],"The":[95,106,126,158,187,197],"such":[100],"that":[101,129,200],"correct.":[105],"proposed":[107],"have":[109,207],"been":[110],"tested":[111,151],"on":[112,211],"well-known":[113],"benchmark":[114],"graphs":[115],"compared":[117],"three":[119],"most":[122],"competitive":[123],"tools.":[125],"show":[128,199],"families":[133],"Vsep":[136,205],"outperforms":[138],"these":[139],"vice-versa":[142],"others.":[147],"None":[148],"outperform":[153],"others":[154],"all":[156],"cases.":[157],"heuristic":[159,188],"versions":[160],"use":[161],"reduced":[162],"trees.":[164],"They":[165,180],"almost":[167],"faster":[171],"than":[172],"very":[177],"rare":[178],"exceptions.":[179],"applied":[182],"mainly":[183],"regular":[185],"choice":[193],"user.":[196],"experiments":[198],"running":[202],"times":[203],"slight":[209],"dependence":[210],"vertex":[212],"labeling.":[213]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}