{"id":"https://openalex.org/W4401596331","doi":"https://doi.org/10.17587/prin.15.402-410","title":"Generation and Analysis of a Dataset of Optimal Double-Loop Circulant Networks","display_name":"Generation and Analysis of a Dataset of Optimal Double-Loop Circulant Networks","publication_year":2024,"publication_date":"2024-08-15","ids":{"openalex":"https://openalex.org/W4401596331","doi":"https://doi.org/10.17587/prin.15.402-410"},"language":"en","primary_location":{"id":"doi:10.17587/prin.15.402-410","doi":"https://doi.org/10.17587/prin.15.402-410","is_oa":false,"landing_page_url":"https://doi.org/10.17587/prin.15.402-410","pdf_url":null,"source":{"id":"https://openalex.org/S4210214422","display_name":"PROGRAMMNAYA INGENERIA","issn_l":"2220-3397","issn":["2220-3397"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programmnaya Ingeneria","raw_type":"journal-article"},"volume":null,"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/A5023361347","display_name":"Emilia A. Monakhova","orcid":"https://orcid.org/0000-0002-6814-4655","observed_orcids":["https://orcid.org/0000-0002-6814-4655"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E. A. Monakhova","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002580461","display_name":"\u041c\u043e\u043d\u0430\u0445\u043e\u0432 \u041e\u043b\u0435\u0433 \u0413\u0435\u043d\u043d\u0430\u0434\u044c\u0435\u0432\u0438\u0447","orcid":"https://orcid.org/0000-0001-8316-418X","observed_orcids":["https://orcid.org/0000-0001-8316-418X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"O. G. Monakhov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1716,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50320704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"8","first_page":"402","last_page":"410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.6973000168800354,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.6973000168800354,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.07670000195503235,"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/T11476","display_name":"Graph theory and applications","score":0.07370000332593918,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/network-diameter","display_name":"network diameter","score":0.4350000023841858},{"id":"https://openalex.org/keywords/graph-classes","display_name":"graph classes","score":0.4729999899864197},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"differential evolution","score":0.7009999752044678},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.7459999918937683},{"id":"https://openalex.org/keywords/graph-datasets","display_name":"graph datasets","score":0.3240000009536743}],"concepts":[{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.829504132270813},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5578716397285461},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5393170714378357},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.46188870072364807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3862544298171997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.353678435087204},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3256210684776306},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21665745973587036},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.17587/prin.15.402-410","doi":"https://doi.org/10.17587/prin.15.402-410","is_oa":false,"landing_page_url":"https://doi.org/10.17587/prin.15.402-410","pdf_url":null,"source":{"id":"https://openalex.org/S4210214422","display_name":"PROGRAMMNAYA INGENERIA","issn_l":"2220-3397","issn":["2220-3397"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programmnaya Ingeneria","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2117159910","https://openalex.org/W2335757200","https://openalex.org/W2049656902","https://openalex.org/W2044900700","https://openalex.org/W2139378013","https://openalex.org/W2312260908","https://openalex.org/W2394404719","https://openalex.org/W2560470131","https://openalex.org/W2348308003","https://openalex.org/W3148564979"],"abstract_inverted_index":{"Optimal":[0],"circulant":[1,30,105],"networks":[2,13,18,31,106,173],"are":[3],"of":[4,10,25,27,35,37,53,65,68,79,85,92,101,118,121,127,133,144,152,170,176,181,192,196],"practical":[5],"interest":[6],"as":[7],"graph":[8],"models":[9],"reliable":[11],"communication":[12],"for":[14,50,113],"supercomputer":[15],"systems":[16],"and":[17,41,137,156,178,198],"on":[19,89],"a":[20,33,150],"chip.":[21],"A":[22,109],"large":[23],"dataset":[24,48],"parameters":[26,81],"optimal":[28,59,86,103,122,171],"double-loop":[29,123,172],"with":[32,174],"number":[34,52,151],"nodes":[36],"up":[38],"to":[39,58,75,98,141,189],"50,000":[40],"451,000":[42],"points":[43],"has":[44],"been":[45],"constructed.":[46],"The":[47],"contains,":[49],"each":[51],"vertices,":[54],"all":[55,164],"generators":[56,175],"corresponding":[57],"or":[60],"suboptimal":[61],"(in":[62],"the":[63,69,80,90,93,96,99,119,131,142,145],"absence":[64],"optimal)":[66],"descriptions":[67,117],"graph.":[70],"This":[71],"made":[72],"it":[73],"possible":[74],"find":[76],"analytical":[77],"dependencies":[78],"that":[82],"define":[83],"families":[84,120,155,169],"graphs.":[87],"Based":[88],"analysis":[91,143],"constructed":[94],"dataset,":[95,147],"solution":[97],"problem":[100],"determining":[102,114],"two-dimensional":[104],"is":[107,111],"studied.":[108],"process":[110],"automated":[112],"analytical,":[115],"parametric":[116],"networks,":[124],"described":[125],"polynomials":[126],"diameter.":[128],"Having":[129],"applied":[130,188],"methods":[132],"integrating":[134],"differential":[135],"evolution":[136],"reduced":[138],"local":[139],"search":[140],"generated":[146],"we":[148],"rediscovered":[149],"previously":[153],"known":[154,166],"found":[157],"more":[158],"than":[159],"200":[160],"new,":[161],"different":[162],"from":[163],"those":[165],"in":[167],"literature,":[168],"linear":[177],"quadratic":[179],"types":[180],"polynomials.":[182],"Our":[183],"new":[184],"ap\u00adproach":[185],"can":[186],"be":[187],"studing":[190],"datasets":[191],"other":[193],"promising":[194],"classes":[195],"graphs":[197],"networks.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-10-02T10:15:12.560889","created_date":"2024-08-15T00:00:00"}