{"id":"https://openalex.org/W3200667282","doi":"https://doi.org/10.13016/an98-igjc","title":"Modern Large-Scale Algorithms for Classical Graph Problems","display_name":"Modern Large-Scale Algorithms for Classical Graph Problems","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3200667282","doi":"https://doi.org/10.13016/an98-igjc","mag":"3200667282"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/27969","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/27969","pdf_url":"http://hdl.handle.net/1903/27969","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1903/27969","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Behnezhad, Soheil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5025934584"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9980999827384949,"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":0.9980999827384949,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9768999814987183,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9585999846458435,"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/computer-science","display_name":"Computer science","score":0.5042082071304321},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.44960054755210876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4129559397697449},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4110148251056671},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34623125195503235},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.12778276205062866},{"id":"https://openalex.org/keywords/cartography","display_name":"Cartography","score":0.08119750022888184}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5042082071304321},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.44960054755210876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4129559397697449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4110148251056671},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34623125195503235},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.12778276205062866},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.08119750022888184}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/27969","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/27969","pdf_url":"http://hdl.handle.net/1903/27969","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},{"id":"mag:3200667282","is_oa":false,"landing_page_url":"https://drum.lib.umd.edu/handle/1903/27969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"doi:10.13016/an98-igjc","is_oa":true,"landing_page_url":"https://doi.org/10.13016/an98-igjc","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/27969","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/27969","pdf_url":"http://hdl.handle.net/1903/27969","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3200667282.pdf","grobid_xml":"https://content.openalex.org/works/W3200667282.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2270541022","https://openalex.org/W1559144499","https://openalex.org/W2286461020","https://openalex.org/W2780030833","https://openalex.org/W2504493224","https://openalex.org/W1570370412","https://openalex.org/W2620598973","https://openalex.org/W2913032799","https://openalex.org/W2288418695","https://openalex.org/W1969434758","https://openalex.org/W2907406590","https://openalex.org/W2553367446","https://openalex.org/W2066115687","https://openalex.org/W1208419045","https://openalex.org/W168622649","https://openalex.org/W2408950374","https://openalex.org/W1500267810","https://openalex.org/W102348317","https://openalex.org/W642484882","https://openalex.org/W2963392151"],"abstract_inverted_index":{"Although":[0],"computing":[1],"power":[2],"has":[3,10,21],"advanced":[4],"at":[5,53,95],"an":[6,24,99],"astonishing":[7],"rate,":[8],"it":[9,80],"been":[11],"far":[12],"outpaced":[13],"by":[14,35],"the":[15,30,41,68,74,90,96,140,163,182,194,249,282],"growing":[16],"scale":[17,55],"of":[18,26,37,50,61,76,89,135,210,258,269,281],"data.":[19],"This":[20],"led":[22],"to":[23,33,83,142,198,274],"abundance":[25],"algorithmic":[27],"problems":[28,228],"where":[29,162],"input":[31,70,91,183,195,214],"tends":[32],"be,":[34],"orders":[36],"magnitude,":[38],"larger":[39],"than":[40,279],"memory":[42,75],"available":[43],"on":[44,112,262],"a":[45,77,199,208,211,216],"single":[46,78],"machine.":[47],"The":[48],"challenges":[49,119],"data":[51],"processing":[52],"this":[54,108],"are":[56,252,268],"inherently":[57],"different":[58],"from":[59],"those":[60],"traditional":[62,105],"algorithms.":[63,106],"For":[64],"instance,":[65],"without":[66],"having":[67,196],"whole":[69],"properly":[71],"stored":[72],"in":[73,181,242,253,277],"machine,":[79],"is":[81,102,165],"unrealistic":[82],"assume":[84],"that":[85,101,116,137,177,188,206,245,267],"any":[86],"arbitrary":[87],"location":[88],"can":[92],"be":[93],"accessed":[94],"same":[97],"cost;":[98],"assumption":[100],"essential":[103],"for":[104,126,225],"In":[107],"thesis,":[109],"we":[110,132],"focus":[111],"modern":[113],"computational":[114],"models":[115,134,244],"capture":[117],"these":[118,243],"more":[120,278],"accurately,":[121],"and":[122,202,239,251,265,272],"devise":[123],"new":[124,223],"algorithms":[125,161,176,187,205,224,260],"several":[127,168],"classical":[128,226],"graph":[129,227,240],"problems.":[130],"Specifically,":[131],"study":[133],"computation":[136,157],"only":[138,190],"allow":[139],"algorithm":[141],"use":[143],"sublinear":[144,172,180,200,217],"resources":[145],"(such":[146],"as":[147,230],"time,":[148],"space,":[149,201],"or":[150],"communication).":[151],"Examples":[152],"include":[153],"(i)":[154],"massively":[155],"parallel":[156],"(\u00e0":[158],"la":[159],"MapReduce)":[160],"workload":[164],"distributed":[166],"among":[167],"machines":[169],"each":[170],"with":[171],"space/communication,":[173],"(ii)":[174],"sublinear-time":[175],"take":[178,189],"time":[179,218],"size,":[184],"(iii)":[185],"streaming":[186],"few":[191],"passes":[192],"over":[193],"access":[197],"(iv)":[203],"dynamic":[204],"maintain":[207],"property":[209],"dynamically":[212],"changing":[213],"using":[215],"per":[219],"update.":[220],"We":[221],"propose":[222],"such":[229],"maximum/maximal":[231],"matching,":[232],"maximal":[233],"independent":[234,270],"set,":[235],"minimum":[236],"vertex":[237],"cover,":[238],"connectivity":[241],"substantially":[246],"improve":[247],"upon":[248],"state-of-the-art":[250],"many":[254],"cases":[255],"optimal.":[256],"Many":[257],"our":[259],"build":[261],"model-independent":[263],"tools":[264],"ideas":[266],"interest":[271],"lead":[273],"improved":[275],"bounds":[276],"one":[280],"aforementioned":[283],"settings.":[284]},"counts_by_year":[],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}