{"id":"https://openalex.org/W4319454214","doi":"https://doi.org/10.1109/imcom56909.2023.10035637","title":"Little tricks leading to a significant acceleration of the calculation of the reliability of a random graph","display_name":"Little tricks leading to a significant acceleration of the calculation of the reliability of a random graph","publication_year":2023,"publication_date":"2023-01-03","ids":{"openalex":"https://openalex.org/W4319454214","doi":"https://doi.org/10.1109/imcom56909.2023.10035637"},"language":"en","primary_location":{"id":"doi:10.1109/imcom56909.2023.10035637","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/imcom56909.2023.10035637","pdf_url":null,"source":{"id":"https://openalex.org/S4363608560","display_name":"2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5061935684","display_name":"Alexey S. Rodionov","orcid":"https://orcid.org/0000-0001-8411-4707"},"institutions":[{"id":"https://openalex.org/I4210110796","display_name":"Institute of Computational Mathematics and Mathematical Geophysics","ror":"https://ror.org/01z686714","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210110796","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexey Rodionov","raw_affiliation_strings":["Institute of Computational Mathematics and Mathematical Geophysics SB RAS,Novosibirsk Oblast Russia","Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk Oblast Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computational Mathematics and Mathematical Geophysics SB RAS,Novosibirsk Oblast Russia","institution_ids":["https://openalex.org/I4210110796"]},{"raw_affiliation_string":"Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk Oblast Russia","institution_ids":["https://openalex.org/I4210110796"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061935684"],"corresponding_institution_ids":["https://openalex.org/I4210110796"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00886144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"262","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9380000233650208,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9380000233650208,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T14470","display_name":"Advanced Data Processing Techniques","score":0.9043999910354614,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.6672408580780029},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5924676656723022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5255228877067566},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.4956303834915161},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4820469319820404},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4337362051010132},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.41199591755867004},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3947460949420929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39026182889938354},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32016149163246155},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2853565812110901},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2651616632938385},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22470074892044067},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1502017080783844},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05955040454864502}],"concepts":[{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.6672408580780029},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5924676656723022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5255228877067566},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.4956303834915161},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4820469319820404},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4337362051010132},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.41199591755867004},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3947460949420929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39026182889938354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32016149163246155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2853565812110901},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2651616632938385},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22470074892044067},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1502017080783844},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05955040454864502},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/imcom56909.2023.10035637","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/imcom56909.2023.10035637","pdf_url":null,"source":{"id":"https://openalex.org/S4363608560","display_name":"2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W6413486","https://openalex.org/W1573446308","https://openalex.org/W1574964770","https://openalex.org/W1589159670","https://openalex.org/W1594677463","https://openalex.org/W1773834868","https://openalex.org/W1972294320","https://openalex.org/W1979348013","https://openalex.org/W2008013300","https://openalex.org/W2014091871","https://openalex.org/W2029478301","https://openalex.org/W2080939161","https://openalex.org/W2113634419","https://openalex.org/W2114625425","https://openalex.org/W2115826669","https://openalex.org/W2117889403","https://openalex.org/W2143676145","https://openalex.org/W2151279678","https://openalex.org/W2160702617","https://openalex.org/W2290127356","https://openalex.org/W2496943738","https://openalex.org/W2502490903","https://openalex.org/W2932627217","https://openalex.org/W2964638337","https://openalex.org/W3007655874","https://openalex.org/W3010896811","https://openalex.org/W3142570770","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W1578200831","https://openalex.org/W1669405875","https://openalex.org/W2958036782","https://openalex.org/W1589618478","https://openalex.org/W4387887613","https://openalex.org/W2033897500","https://openalex.org/W4246688532","https://openalex.org/W2502563274","https://openalex.org/W139348750","https://openalex.org/W2885987986"],"abstract_inverted_index":{"Methods":[0],"for":[1,4,73,87],"preparing":[2],"conditions":[3],"the":[5,21,30,40,61,76,93,103],"efficient":[6],"use":[7,70],"of":[8,23,42,63,78],"graph":[9,94],"structure":[10],"decomposition":[11,74],"are":[12],"proposed,":[13],"which":[14],"makes":[15],"it":[16],"possible":[17],"to":[18,59],"speed":[19],"up":[20],"calculation":[22],"its":[24,34],"general":[25],"terminal":[26],"reliability,":[27],"that":[28,32,48,91,102],"is,":[29],"probability":[31],"all":[33],"vertices":[35,44],"will":[36],"be":[37],"connected":[38],"in":[39,65,75,96],"case":[41],"reliable":[43,83],"and":[45,69],"unreliable":[46],"edges":[47,64],"can":[49],"fail":[50],"independently":[51],"with":[52],"given":[53],"probabilities.":[54],"The":[55],"main":[56],"idea":[57],"is":[58,98,106],"enumerate":[60],"states":[62],"an":[66],"arbitrary":[67],"section":[68],"known":[71],"equations":[72],"cases":[77],"1,":[79],"2":[80],"or":[81],"3":[82],"edges.":[84],"A":[85],"technique":[86],"finding":[88],"a":[89],"cut":[90],"divides":[92],"approximately":[95],"half":[97],"proposed.":[99],"Experiments":[100],"show":[101],"proposed":[104],"approach":[105],"quite":[107],"effective.":[108]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}