{"id":"https://openalex.org/W4210718758","doi":"https://doi.org/10.3103/s0146411621070166","title":"Parallel Algorithm for Solving the Graph Isomorphism Problem","display_name":"Parallel Algorithm for Solving the Graph Isomorphism Problem","publication_year":2021,"publication_date":"2021-12-01","ids":{"openalex":"https://openalex.org/W4210718758","doi":"https://doi.org/10.3103/s0146411621070166"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411621070166","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411621070166","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","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/A5074183463","display_name":"V. V. Vasilchikov","orcid":"https://orcid.org/0000-0001-7882-8906"},"institutions":[{"id":"https://openalex.org/I198371094","display_name":"Yaroslavl State University","ror":"https://ror.org/044s2fj67","country_code":"RU","type":"education","lineage":["https://openalex.org/I198371094"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"V. V. Vasilchikov","raw_affiliation_strings":["Demidov Yaroslavl State University, 150003, Yaroslavl, Russia"],"raw_orcid":"https://orcid.org/0000-0001-7882-8906","affiliations":[{"raw_affiliation_string":"Demidov Yaroslavl State University, 150003, Yaroslavl, Russia","institution_ids":["https://openalex.org/I198371094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074183463"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":null,"apc_paid":null,"fwci":0.1942,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.52207985,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"55","issue":"7","first_page":"617","last_page":"622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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/computer-science","display_name":"Computer science","score":0.8622571229934692},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.6414199471473694},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49166303873062134},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48417335748672485},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4661012887954712},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46298423409461975},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43060818314552307},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.42978647351264954},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4219849109649658},{"id":"https://openalex.org/keywords/parallel-programming-model","display_name":"Parallel programming model","score":0.41677045822143555},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37985116243362427},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3531458377838135},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.27140820026397705},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10872045159339905}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8622571229934692},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.6414199471473694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49166303873062134},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48417335748672485},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4661012887954712},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46298423409461975},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43060818314552307},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.42978647351264954},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4219849109649658},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.41677045822143555},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37985116243362427},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3531458377838135},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.27140820026397705},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10872045159339905},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","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},{"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411621070166","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411621070166","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","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/W2011039300","https://openalex.org/W2068473350","https://openalex.org/W2078391137","https://openalex.org/W2095052098","https://openalex.org/W2409645877","https://openalex.org/W2789876835","https://openalex.org/W2800289680","https://openalex.org/W4213214460","https://openalex.org/W4245361680"],"related_works":["https://openalex.org/W1258892498","https://openalex.org/W1522618089","https://openalex.org/W4360838296","https://openalex.org/W2187958446","https://openalex.org/W3080158623","https://openalex.org/W1856194915","https://openalex.org/W2389075355","https://openalex.org/W2041670454","https://openalex.org/W2183579781","https://openalex.org/W2221885959"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,19,62,101,114,163],"parallel":[6,98,125],"algorithm":[7,60,213],"for":[8,34,70,97,145],"solving":[9],"the":[10,26,46,54,74,84,91,105,108,121,154,169,177,182,187,205,212,219],"graph":[11],"isomorphism":[12],"problem.":[13],"Our":[14],"goal":[15],"is":[16,32,43,65],"to":[17,24,123,180,186],"construct":[18],"suitable":[20],"vertex":[21],"substitution":[22],"or":[23,56],"prove":[25],"absence":[27,57],"of":[28,53,58,107,127,176,190,200,211],"such.":[29],"The":[30,51,86,140,174],"problem":[31,160],"solved":[33],"undirected":[35],"graphs":[36,47,196],"without":[37],"loops":[38],"and":[39,133,161,214],"multiple":[40],"edges;":[41],"it":[42],"assumed":[44],"that":[45],"can":[48,142],"be":[49,143],"disconnected.":[50],"question":[52,75],"existence":[55],"an":[59],"with":[61,197],"polynomial":[63],"complexity":[64],"currently":[66],"open.":[67],"Therefore,":[68],"as":[69,204,216,218],"any":[71,149],"time-consuming":[72],"task,":[73],"arises":[76],"about":[77],"speeding":[78],"up":[79],"its":[80],"solution":[81],"by":[82,90,153],"parallelizing":[83],"algorithm.":[85],"RPM_ParLib":[87],"library":[88,141],"developed":[89],"author":[92],"allows":[93],"developing":[94],"effective":[95],"applications":[96,119,146,167],"computing":[99,138],"on":[100],"local":[102],"network":[103],"under":[104],"control":[106],"runtime":[109],"environment":[110],".NET":[111,155],"Framework.":[112,156],"Supporting":[113],"recursive-parallel":[115,188],"programming":[116,150],"style,":[117],"such":[118],"have":[120],"ability":[122],"generate":[124],"branches":[126],"computation":[128],"directly":[129],"during":[130],"program":[131],"execution":[132],"dynamically":[134],"redistribute":[135],"work":[136],"between":[137],"modules.":[139],"used":[144,203],"written":[147],"in":[148,168],"language":[151,171],"supported":[152],"To":[157],"solve":[158],"our":[159],"conduct":[162],"numerical":[164],"experiment,":[165,215],"several":[166],"C#":[170],"were":[172,202],"developed.":[173],"purpose":[175],"experiment":[178],"was":[179],"study":[181],"acceleration":[183],"achieved":[184],"due":[185],"organization":[189],"calculations.":[191],"Specially":[192],"generated":[193],"random":[194],"regular":[195],"various":[198],"degrees":[199],"vertices":[201],"initial":[206],"data.":[207],"A":[208],"detailed":[209],"description":[210],"well":[217],"results":[220],"obtained,":[221],"are":[222],"also":[223],"given.":[224]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}