{"id":"https://openalex.org/W183165232","doi":null,"title":"A Random Graph Generator","display_name":"A Random Graph Generator","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W183165232","mag":"183165232"},"language":"en","primary_location":{"id":"mag:183165232","doi":null,"is_oa":false,"landing_page_url":"http://ahvaz.ist.unomaha.edu/azad/temp/randgraphs/10-horn-random-graph-generator-prim-spanning-tree.PDF","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W183165232"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5045272567","display_name":"Monica Van Horn","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Monica Van Horn","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045272567"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6420999765396118,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.6420999765396118,"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.2815000116825104,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.009700000286102295,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/random-graph-generation","display_name":"random graph generation","score":0.9700000286102295},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7310000061988831},{"id":"https://openalex.org/keywords/algorithm-testing","display_name":"algorithm testing","score":0.6740000247955322},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.414000004529953}],"concepts":[{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.6614523530006409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6318398714065552},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4480929970741272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41705167293548584},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3912096619606018}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:183165232","doi":null,"is_oa":false,"landing_page_url":"http://ahvaz.ist.unomaha.edu/azad/temp/randgraphs/10-horn-random-graph-generator-prim-spanning-tree.PDF","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.1446","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.1446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.css.edu/depts/cis/mics_2003/MICS2003_Papers/VanHorn.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W301824129","https://openalex.org/W1522343170","https://openalex.org/W1963899453","https://openalex.org/W1973442596"],"related_works":["https://openalex.org/W4298837476","https://openalex.org/W2968515041","https://openalex.org/W3152223819","https://openalex.org/W7099165522","https://openalex.org/W4287829684","https://openalex.org/W2297285595","https://openalex.org/W3046658742","https://openalex.org/W1490692072","https://openalex.org/W7095946943","https://openalex.org/W2528290647"],"abstract_inverted_index":{"Random":[0],"graph":[1,82,183],"generation":[2],"is":[3,52,148],"commonly":[4],"used":[5,40,177],"in":[6,109],"studying":[7],"solutions":[8,68],"to":[9,22,41,55,63,69,140,144,153,178],"approximation":[10],"algorithms.":[11,70,167],"If":[12],"random":[13,81,136],"graphs":[14,58,137,155],"can":[15,38],"be":[16,39,61,176],"generated,":[17],"they":[18],"provide":[19],"a":[20,80,90],"way":[21],"test":[23,165],"algorithms":[24],"for":[25,93,123],"hard":[26],"problems":[27],"that":[28,59,156,162],"have":[29],"no":[30],"optimal":[31],"solution.":[32],"By":[33],"using":[34],"these":[35],"graphs,":[36],"simulations":[37],"determine,":[42],"on":[43,89],"the":[44,75,105,110,112,117,119,127,173],"average,":[45],"how":[46,172],"well":[47,85],"an":[48],"algorithm":[49,184],"performs.":[50],"It":[51],"also":[53,151],"possible":[54],"generate":[56,154],"'bad'":[57],"will":[60,73,170],"able":[62],"approach":[64],"some":[65],"worst":[66],"case":[67],"This":[71],"paper":[72],"discuss":[74,171],"design":[76,97],"and":[77,126,129],"implementation":[78],"of":[79,98,107,114,116,121,131],"generator":[83,100,174],"as":[84,86],"its":[87],"use":[88],"scheduling":[91],"problem":[92],"distributed/parallel":[94],"systems.":[95],"The":[96],"our":[99,166],"must":[101],"take":[102],"into":[103],"consideration":[104],"number":[106,113,120],"nodes":[108],"graph,":[111,118],"levels":[115],"children":[122],"each":[124,132,145],"node,":[125],"height":[128],"width":[130],"graph.":[133],"Many":[134],"truly":[135],"turn":[138],"out":[139],"look":[141],"very":[142],"similar":[143],"other.":[146],"That":[147],"why":[149],"we":[150,169],"decided":[152],"were":[157],"'random'":[158],"under":[159],"certain":[160],"constraints":[161],"would":[163],"better":[164],"Lastly,":[168],"could":[175],"help":[179],"others":[180],"simulate":[181],"their":[182],"problems.":[185]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W183165232","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}
