{"id":"https://openalex.org/W1969797470","doi":"https://doi.org/10.1137/0215045","title":"Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism","display_name":"Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism","publication_year":1986,"publication_date":"1986-05-01","ids":{"openalex":"https://openalex.org/W1969797470","doi":"https://doi.org/10.1137/0215045","mag":"1969797470"},"language":"en","primary_location":{"id":"doi:10.1137/0215045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215045","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/A5048667886","display_name":"Joan Feigenbaum","orcid":"https://orcid.org/0000-0002-3735-6022"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joan Feigenbaum","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000317216","display_name":"Alejandro A. Sch\u00e4ffer","orcid":"https://orcid.org/0000-0002-2147-8033"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alejandro A. Sch\u00e4ffer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048667886"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.08855213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"15","issue":"2","first_page":"619","last_page":"627"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9962000250816345,"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/combinatorics","display_name":"Combinatorics","score":0.7970312237739563},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.7539684772491455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5547298192977905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5278815031051636},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5274774432182312},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4631596803665161},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4464063346385956},{"id":"https://openalex.org/keywords/symmetric-graph","display_name":"Symmetric graph","score":0.4432433843612671},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.41338303685188293},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2872579097747803},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2068103551864624}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7970312237739563},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.7539684772491455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5547298192977905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5278815031051636},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5274774432182312},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4631596803665161},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4464063346385956},{"id":"https://openalex.org/C14201764","wikidata":"https://www.wikidata.org/wiki/Q1205074","display_name":"Symmetric graph","level":5,"score":0.4432433843612671},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.41338303685188293},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2872579097747803},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2068103551864624}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215045","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":9,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1974940671","https://openalex.org/W1984333836","https://openalex.org/W1984560021","https://openalex.org/W2025904765","https://openalex.org/W2027284944","https://openalex.org/W2093454413","https://openalex.org/W4212875219","https://openalex.org/W4234956562"],"related_works":["https://openalex.org/W2124568589","https://openalex.org/W2157783000","https://openalex.org/W1883847458","https://openalex.org/W1987143101","https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W4287069768","https://openalex.org/W2903402681","https://openalex.org/W4312396101","https://openalex.org/W3139101777"],"abstract_inverted_index":{"We":[0,66],"consider":[1],"composition,":[2],"a":[3,13],"graph":[4,31,76],"multiplication":[5],"operator":[6],"defined":[7],"by":[8],"Harary":[9],"and":[10,21,39,59],"Sabidussi,":[11],"from":[12],"complexity":[14,70,97],"theoretic":[15],"point":[16],"of":[17,71,84,98],"view.":[18],"If":[19],"G":[20],"H":[22],"are":[23,103],"undirected":[24],"graphs":[25,87,102],"without":[26],"self-loops,":[27],"then":[28],"the":[29,69,82,89,96],"composite":[30],"$G[H]$":[32],"has":[33],"vertex":[34],"set":[35,41],"$V(G)":[36],"\\times":[37],"V(H)$":[38],"edge":[40],"$\\{":[42],"(g_1":[43],",h_1":[44],")":[45],"\\text{---}":[46,50,61],"(g_2":[47],",h_2":[48],"):g_1":[49],"g_2":[51,57],"\\in":[52,63],"E(G){\\text{":[53],"or":[54],"}}g_1":[55],"=":[56],"{\\text{":[58],"}}h_1":[60],"h_2":[62],"E(H)\\}":[64],"$.":[65],"show":[67],"that":[68],"testing":[72,99],"whether":[73,100],"an":[74],"arbitrary":[75],"can":[77],"be":[78],"written":[79],"nontrivially":[80],"as":[81,95],"composition":[83],"two":[85,101],"smaller":[86],"is":[88],"same,":[90],"to":[91],"within":[92],"polynomial":[93],"factors,":[94],"isomorphic.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}