{"id":"https://openalex.org/W1998167497","doi":"https://doi.org/10.1137/0209041","title":"Random Graphs and Graph Optimization Problems","display_name":"Random Graphs and Graph Optimization Problems","publication_year":1980,"publication_date":"1980-08-01","ids":{"openalex":"https://openalex.org/W1998167497","doi":"https://doi.org/10.1137/0209041","mag":"1998167497"},"language":"en","primary_location":{"id":"doi:10.1137/0209041","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209041","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/A5023529796","display_name":"Bruce W. Weide","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bruce W. Weide","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023529796"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.13072928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"3","first_page":"552","last_page":"557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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.9962999820709229,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6149433255195618},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5914372801780701},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5790294408798218},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5370928049087524},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5002853870391846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49028685688972473},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4371795058250427},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37221235036849976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3578804135322571}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6149433255195618},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5914372801780701},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5790294408798218},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5370928049087524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5002853870391846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49028685688972473},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4371795058250427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37221235036849976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3578804135322571},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0209041","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209041","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":8,"referenced_works":["https://openalex.org/W1580334350","https://openalex.org/W2009232680","https://openalex.org/W2014068360","https://openalex.org/W2025904765","https://openalex.org/W2060827745","https://openalex.org/W2112575355","https://openalex.org/W2325016962","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W2046552997","https://openalex.org/W2913191894","https://openalex.org/W4389782626","https://openalex.org/W4376138746"],"abstract_inverted_index":{"One":[0],"major":[1],"difficulty":[2],"in":[3,46],"analyzing":[4],"algorithms":[5],"for":[6,33],"graph":[7,56],"optimization":[8,57],"problems":[9,24,78],"is":[10,25,105],"that":[11,86,102],"the":[12,16,22,39,50,60,74,81,93,103],"probabilistic":[13,51],"behavior":[14,52],"of":[15,21,41,43,53,73],"optimum":[17,94],"solutions":[18,54,95],"to":[19,49,55,76],"most":[20],"important":[23],"generally":[26],"unknown.":[27],"We":[28],"present":[29],"a":[30],"general":[31],"method":[32],"relating":[34],"some":[35],"well-known":[36],"results":[37],"regarding":[38],"probability":[40],"existence":[42],"certain":[44],"subgraphs":[45],"random":[47],"graphs":[48,62],"problems,":[58],"where":[59],"problem":[61,84],"have":[63,97],"edge":[64],"weights":[65],"independently":[66],"chosen":[67],"from":[68],"an":[69],"arbitrary":[70],"distribution.":[71],"Application":[72],"technique":[75],"well-studied":[77],"such":[79],"as":[80],"traveling":[82],"salesman":[83],"shows":[85],"stronger":[87],"statements":[88],"can":[89],"be":[90],"made":[91],"about":[92],"than":[96],"previously":[98],"been":[99],"proved,":[100],"and":[101],"analysis":[104],"straightforward.":[106]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}