{"id":"https://openalex.org/W2106746007","doi":"https://doi.org/10.1109/sct.1995.514867","title":"On finding the number of graph automorphisms","display_name":"On finding the number of graph automorphisms","publication_year":2002,"publication_date":"2002-11-19","ids":{"openalex":"https://openalex.org/W2106746007","doi":"https://doi.org/10.1109/sct.1995.514867","mag":"2106746007"},"language":"en","primary_location":{"id":"doi:10.1109/sct.1995.514867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1995.514867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2117/370819","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082398104","display_name":"Richard Chang","orcid":"https://orcid.org/0000-0001-5278-7958"},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Chang","raw_affiliation_strings":["University of Maryland Baltimore County, Baltimore, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland Baltimore County, Baltimore, MD, USA","institution_ids":["https://openalex.org/I79272384"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089274175","display_name":"William Gasarch","orcid":"https://orcid.org/0000-0003-3698-5991"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W. Gasarch","raw_affiliation_strings":["University of Maryland College Park, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland College Park, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027370903","display_name":"Jacobo Tor\u00e1n","orcid":"https://orcid.org/0000-0003-2168-4969"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"J. Toran","raw_affiliation_strings":["Universitat Polilt\u00e8cnica de Catalunya, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Polilt\u00e8cnica de Catalunya, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7704,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68570193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"6","issue":null,"first_page":"288","last_page":"298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.8864160776138306},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7138669490814209},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.6961943507194519},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5816200971603394},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.5612138509750366},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5567740201950073},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5530329346656799},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.5500161647796631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5481376051902771},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09635263681411743},{"id":"https://openalex.org/keywords/crystallography","display_name":"Crystallography","score":0.05657905340194702},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.05113738775253296}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.8864160776138306},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7138669490814209},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.6961943507194519},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5816200971603394},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.5612138509750366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5567740201950073},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5530329346656799},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.5500161647796631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5481376051902771},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09635263681411743},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.05657905340194702},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.05113738775253296},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sct.1995.514867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sct.1995.514867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:upcommons.upc.edu:2117/370819","is_oa":true,"landing_page_url":"http://hdl.handle.net/2117/370819","pdf_url":null,"source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":{"id":"pmh:oai:upcommons.upc.edu:2117/370819","is_oa":true,"landing_page_url":"http://hdl.handle.net/2117/370819","pdf_url":null,"source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W48693379","https://openalex.org/W73733072","https://openalex.org/W189098498","https://openalex.org/W1480319329","https://openalex.org/W1560182867","https://openalex.org/W1970089350","https://openalex.org/W1970606468","https://openalex.org/W1974672137","https://openalex.org/W1982547542","https://openalex.org/W1989114462","https://openalex.org/W1999384241","https://openalex.org/W2006912660","https://openalex.org/W2016588822","https://openalex.org/W2026005637","https://openalex.org/W2040234790","https://openalex.org/W2047808405","https://openalex.org/W2063158069","https://openalex.org/W2066447087","https://openalex.org/W2072181151","https://openalex.org/W2076597612","https://openalex.org/W2081812591","https://openalex.org/W2095869086","https://openalex.org/W2120980679","https://openalex.org/W2123376621","https://openalex.org/W2137407595","https://openalex.org/W2140152225","https://openalex.org/W2162763810","https://openalex.org/W2328208253","https://openalex.org/W3175367423","https://openalex.org/W3202159599"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W1972481159","https://openalex.org/W2094468224","https://openalex.org/W2000487993","https://openalex.org/W1973052363","https://openalex.org/W1980641386","https://openalex.org/W2135152748","https://openalex.org/W2132512348","https://openalex.org/W2089792255","https://openalex.org/W2106746007"],"abstract_inverted_index":{"This":[0],"paper":[1,63],"investigates":[2],"the":[3,6,9,20,25,65,69,74],"enumerability":[4,70],"of":[5,11,13,23,55,71],"function":[7,30,40],"GA,":[8],"number":[10],"automorphisms":[12],"an":[14],"undirected":[15],"graph,":[16],"in":[17,61],"relation":[18],"to":[19],"computational":[21],"complexity":[22],"GI,":[24],"Graph":[26,75],"Isomorphism":[27,76],"problem.":[28,77],"A":[29],"f":[31],"(on":[32],"graphs)":[33],"is":[34,57,84],"b(n)-enumerable":[35],"if":[36],"there":[37],"exists":[38],"a":[39],"g/spl":[41],"isin/PF":[42],"such":[43],"that":[44],"for":[45],"all":[46],"n-node":[47],"graphs":[48],"G,":[49],"g(G)":[50],"lists":[51],"b(n)":[52],"numbers,":[53],"one":[54],"which":[56],"f(G).":[58],"The":[59],"results":[60],"this":[62],"show":[64],"following":[66],"connections":[67],"between":[68],"GA":[72,83],"and":[73],"1.":[78],"For":[79],"/spl":[80],"epsiv/e/spl":[81],"ap/2.718,":[82],"c/sup":[85],"n/-enumerable.":[86]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}