{"id":"https://openalex.org/W4407394774","doi":"https://doi.org/10.3103/s0146411624700287","title":"Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem","display_name":"Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem","publication_year":2024,"publication_date":"2024-12-01","ids":{"openalex":"https://openalex.org/W4407394774","doi":"https://doi.org/10.3103/s0146411624700287"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411624700287","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411624700287","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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26210938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"58","issue":"7","first_page":"827","last_page":"835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9815000295639038,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8511528968811035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5433651804924011},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40131497383117676}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8511528968811035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5433651804924011},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40131497383117676}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411624700287","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411624700287","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":10,"referenced_works":["https://openalex.org/W176100319","https://openalex.org/W1974032838","https://openalex.org/W2061344791","https://openalex.org/W2068473350","https://openalex.org/W2116007667","https://openalex.org/W2168933917","https://openalex.org/W2604114816","https://openalex.org/W2966915742","https://openalex.org/W4210718758","https://openalex.org/W4392210491"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,69,217],"propose":[4],"an":[5],"algorithm":[6,21,100],"for":[7,163],"solving":[8,50],"the":[9,20,39,56,77,83,88,90,99,108,128,131,172,178,184,188,194,219,222,228,232],"maximum":[10],"common":[11,79],"subgraph":[12],"problem.":[13],"The":[14,136,175],"sequential":[15],"and":[16,22,28,143,149,227],"parallel":[17,106,119],"versions":[18],"of":[19,38,58,76,87,130,147,153,177,191,208,221],"their":[23,29],"software":[24],"implementation":[25],"are":[26],"described,":[27],"effectiveness":[30],"is":[31,36,101,111,181,202,214],"experimentally":[32],"studied.":[33],"This":[34],"problem":[35],"one":[37],"most":[40],"famous":[41],"NP-complete":[42],"problems.":[43],"Its":[44],"solution":[45,96],"may":[46],"be":[47,161],"required":[48],"when":[49],"many":[51],"practical":[52],"problems":[53],"related":[54],"to":[55,71,82,92,117,182,204],"study":[57,183],"complex":[59],"structures.":[60],"We":[61],"solve":[62],"it":[63,115],"in":[64,67,166,199],"a":[65,123,139,196],"formulation":[66],"which":[68,113],"need":[70],"find":[72],"all":[73],"possible":[74,116],"isomorphisms":[75],"found":[78],"subgraph.":[80],"Due":[81],"extremely":[84],"high":[85],"complexity":[86],"problem,":[89],"desire":[91],"speed":[93],"up":[94],"its":[95],"by":[97,171],"parallelizing":[98],"quite":[102],"natural.":[103],"To":[104],"organize":[105],"computing,":[107],"RPM_ParLib":[109],"library":[110,137],"used,":[112],"makes":[114],"create":[118],"applications":[120,164],"running":[121],"on":[122],"local":[124],"computer":[125],"network":[126],"under":[127],"control":[129],".NET":[132,173],"Framework":[133],"runtime":[134],"environment.":[135],"supports":[138],"recursive-parallel":[140,189],"programming":[141,168],"style":[142],"ensures":[144],"efficient":[145],"distribution":[146],"work":[148],"dynamic":[150],"load":[151],"balancing":[152],"computing":[154],"modules":[155],"during":[156,231],"program":[157],"execution.":[158],"It":[159],"can":[160],"used":[162],"written":[165],"any":[167],"language":[169],"supported":[170],"Framework.":[174],"purpose":[176],"numerical":[179],"experiment":[180],"acceleration":[185],"achieved":[186],"through":[187],"organization":[190],"calculations.":[192],"For":[193],"experiment,":[195],"special":[197],"application":[198],"C#":[200],"that":[201],"designed":[203],"generate":[205],"various":[206],"sets":[207],"initial":[209,224],"data":[210],"with":[211],"specified":[212],"parameters":[213],"developed.":[215],"Here,":[216],"describe":[218],"characteristics":[220],"generated":[223],"graph":[225],"pairs":[226],"results":[229],"obtained":[230],"experiment.":[233]},"counts_by_year":[],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}