{"id":"https://openalex.org/W6903522498","doi":"https://doi.org/10.13016/fpoi-s5u5","title":"Fair and Scalable Algorithms on Massive Graphs","display_name":"Fair and Scalable Algorithms on Massive Graphs","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6903522498","doi":"https://doi.org/10.13016/fpoi-s5u5"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/31706","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/31706","pdf_url":"https://drum.lib.umd.edu/bitstreams/3e315879-c0be-44cb-be89-c14e1d97151f/download","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":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drum.lib.umd.edu/bitstreams/3e315879-c0be-44cb-be89-c14e1d97151f/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Knittel, Marina","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Knittel, Marina","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"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":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.73580002784729},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6582000255584717},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5313000082969666},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.48489999771118164},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4147000014781952},{"id":"https://openalex.org/keywords/big-data","display_name":"Big data","score":0.39570000767707825},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.34790000319480896},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.33009999990463257}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7706000208854675},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.73580002784729},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6582000255584717},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5313000082969666},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.48489999771118164},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4147000014781952},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4043000042438507},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.39570000767707825},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3944000005722046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.382099986076355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36079999804496765},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.33009999990463257},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C144817290","wikidata":"https://www.wikidata.org/wiki/Q2976575","display_name":"Biclustering","level":5,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/31706","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/31706","pdf_url":"https://drum.lib.umd.edu/bitstreams/3e315879-c0be-44cb-be89-c14e1d97151f/download","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":"doi:10.13016/fpoi-s5u5","is_oa":true,"landing_page_url":"https://doi.org/10.13016/fpoi-s5u5","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":"thesis"}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/31706","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/31706","pdf_url":"https://drum.lib.umd.edu/bitstreams/3e315879-c0be-44cb-be89-c14e1d97151f/download","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":[{"display_name":"Peace, Justice and strong institutions","score":0.8196145296096802,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6903522498.pdf","grobid_xml":"https://content.openalex.org/works/W6903522498.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"impact":[1],"of":[2,30,48,84,98,208,225,337],"massive":[3,38],"data":[4],"processing":[5],"on":[6,58,66,67,74,241,339],"our":[7,151,239],"daily":[8],"lives":[9],"is":[10,307],"becoming":[11],"increasingly":[12],"more":[13],"clear.":[14],"With":[15],"this,":[16],"we":[17,40,64,109,173,237,314],"must":[18],"guarantee":[19],"that":[20,298],"vital,":[21],"data-driven":[22],"decision-making":[23],"systems":[24],"mitigate":[25],"the":[26,31,37,82,104,111,124,165,175,209,219,264,294,335],"potential":[27],"negative":[28],"impacts":[29],"technologies":[32],"themselves":[33],"and":[34,54,132,135,150,232,251,254,304,319,332],"scale":[35],"to":[36,43,103,192,270,285],"datasets":[39],"have":[41],"access":[42,269],"today.":[44],"We":[45],"explore":[46],"both":[47],"these":[49],"facets":[50],"by":[51,88,267],"studying":[52],"fairness":[53],"scalability":[55],"for":[56,115,197,214,322],"algorithms":[57,114,196,217],"large":[59],"graphs.":[60],"In":[61,234,311],"Part":[62,203,312],"I,":[63],"focus":[65],"fair":[68,85,125,147],"hierarchical":[69,86,105,119,248],"clustering.":[70],"Our":[71,141],"first":[72,112],"work":[73,143,240],"this":[75,235],"topic":[76],"[Ahmadian":[77],"et":[78,91,94,138,155,159,245,258,329,344],"al.,":[79,95,139,156,160,246,259,330,345],"2020b]":[80],"initiates":[81],"study":[83],"clustering":[87,102,120,249],"extending":[89],"Chierichetti":[90],"al.\u2019s":[92],"[Chierichetti":[93],"2017]":[96],"notion":[97],"representationally":[99],"proportional":[100],"flat":[101],"setting.":[106],"From":[107],"there,":[108],"introduce":[110,315],"approximation":[113],"three":[116,146],"well":[117,182],"studied":[118],"optimization":[121,148,169],"problems":[122,342],"in":[123,202,218,280,290,309,326],"context:":[126],"cost":[127,168],"[Dasgupta,":[128],"2016],":[129],"revenue":[130],"[Moseley":[131],"Wang,":[133],"2017],":[134],"value":[136],"[Cohen-Addad":[137],"2018].":[140],"initial":[142],"studies":[144],"all":[145],"problems,":[149],"follow-up":[152],"works":[153],"[Knittel":[154],"2023a,":[157],"Knittel":[158],"2023b]":[161],"dive":[162],"deeper":[163],"into":[164],"notoriously":[166],"difficult":[167,308],"problem.":[170],"Regarding":[171],"scalability,":[172],"leverage":[174],"Massively":[176,188],"Parallel":[177,189],"Computation":[178,190],"(MPC)":[179],"model,":[180,236],"as":[181,183],"its":[184],"recent":[185],"successor":[186],"Adaptive":[187],"(AMPC),":[191],"develop":[193],"efficient":[194,318],"graph":[195],"big":[198],"data.":[199],"MPC,":[200],"discussed":[201],"II,":[204],"has":[205],"been":[206],"one":[207],"most":[210],"practically":[211],"useful":[212],"models":[213],"massively":[215],"parallel":[216],"past":[220],"decade,":[221],"influencing":[222],"a":[223,271,301,316],"number":[224],"major":[226],"frameworks":[227],"including":[228],"MapReduce,":[229],"Hadoop,":[230],"Spark,":[231],"Flume.":[233],"present":[238],"edge":[242],"coloring":[243],"[Behnezhad":[244],"2019b],":[247],"[Hajiaghayi":[250,328,343],"Knittel,":[252],"2020],":[253],"tree":[255,324],"embeddings":[256],"[Ahanchi":[257],"2023].":[260],"AMPC":[261,327,338],"improves":[262],"upon":[263],"MPC":[265,291],"model":[266],"adding":[268],"distributed":[272],"hash":[273],"table":[274],"while":[275],"still":[276],"remaining":[277],"highly":[278,317],"implementable":[279],"practice.":[281],"This":[282],"allows":[283],"it":[284],"overcome":[286],"some":[287],"shortcomings":[288],"proposed":[289],"literature,":[292],"notably,":[293],"1vs2Cycle":[295],"Conjecture":[296],"(i.e.,":[297],"differentiating":[299],"between":[300],"single":[302],"cycle":[303],"two":[305],"cycles":[306],"MPC).":[310],"III,":[313],"general":[320],"tool":[321],"executing":[323],"contractions":[325],"2022b]":[331],"additionally":[333],"exhibit":[334],"power":[336],"minimum":[340],"cut":[341],"2022a].":[346]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}