{"id":"https://openalex.org/W7096598173","doi":null,"title":"Filtering: A Method for Solving Graph Problems in","display_name":"Filtering: A Method for Solving Graph Problems in","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7096598173"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.9532","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.9532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~sergei/papers/spaa11-matchings.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7096598173"],"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/A5022550622","display_name":"Silvio Lattanzi","orcid":"https://orcid.org/0000-0002-3502-7559","observed_orcids":["https://orcid.org/0000-0002-3502-7559"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silvio Lattanzi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Benjamin Moseley","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070795618","display_name":"Sergei Vassilvitskii","orcid":"https://orcid.org/0000-0003-0235-1624","observed_orcids":["https://orcid.org/0000-0003-0235-1624"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sergei Vassilvitskii","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Siddharth Suri","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Siddharth Suri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7890999913215637,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7890999913215637,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.1817999929189682,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.011900000274181366,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/filtering","display_name":"filtering","score":0.5860000252723694},{"id":"https://openalex.org/keywords/mapreduce","display_name":"MapReduce","score":0.9860000014305115},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.8569999933242798},{"id":"https://openalex.org/keywords/dense-graphs","display_name":"dense graphs","score":0.6899999976158142},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.6819999814033508},{"id":"https://openalex.org/keywords/maximal-matching","display_name":"maximal matching","score":0.9459999799728394},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.906000018119812},{"id":"https://openalex.org/keywords/edge-cover","display_name":"edge covering","score":1.0},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"minimum cut","score":0.8999999761581421},{"id":"https://openalex.org/keywords/sublinear-memory","display_name":"sublinear memory","score":0.8149999976158142}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7932000160217285},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5224999785423279},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.47130000591278076},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4627000093460083},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4526999890804291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4431000053882599},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4374000132083893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42750000953674316},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3971000015735626},{"id":"https://openalex.org/C13600138","wikidata":"https://www.wikidata.org/wiki/Q8799","display_name":"Petabyte","level":3,"score":0.3479999899864197},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.34700000286102295},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.3416000008583069},{"id":"https://openalex.org/C3019257732","wikidata":"https://www.wikidata.org/wiki/Q567759","display_name":"Map reduce","level":3,"score":0.335099995136261},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2962999939918518},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.9532","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.9532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~sergei/papers/spaa11-matchings.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2153977620","https://openalex.org/W7095575091","https://openalex.org/W7097766226","https://openalex.org/W2189017277","https://openalex.org/W2295401709","https://openalex.org/W2020302654","https://openalex.org/W2943788922","https://openalex.org/W2172275498","https://openalex.org/W2088011174","https://openalex.org/W1978303644"],"abstract_inverted_index":{"The":[0,71],"MapReduce":[1,26,67,112,177,204],"framework":[2,37,68,113],"is":[3,28,38,76],"currently":[4],"the":[5,21,32,36,40,66,79,82,90,111,156,162,170,174,188,208,216,223,237],"de":[6],"facto":[7],"standard":[8],"used":[9],"throughout":[10],"both":[11],"industry":[12],"and":[13,49,140,143,173,228],"academia":[14],"for":[15,114,121,129],"petabyte":[16],"scale":[17],"data":[18],"analysis.":[19],"As":[20],"input":[22,41,83],"to":[23,77,166],"a":[24,46,60,85,100,115,200,233],"typical":[25],"computation":[27],"large,":[29],"one":[30],"of":[31,35,81,117,148,158,176,203,211,225],"key":[33],"requirements":[34],"that":[39,89,185,220,230],"cannot":[42],"be":[43,51,97],"stored":[44],"on":[45,99,161],"single":[47,101],"machine":[48],"must":[50],"processed":[52],"in":[53,65,84,110,199],"parallel.":[54],"In":[55,146],"this":[56,104],"paper":[57],"we":[58,106,126,151,182,214],"describe":[59],"general":[61],"algorithmic":[62],"design":[63],"technique":[64],"called":[69],"filtering.":[70],"main":[72],"idea":[73],"behind":[74],"filtering":[75],"reduce":[78],"size":[80],"distributed":[86],"fashion":[87],"so":[88],"resulting,":[91],"much":[92],"smaller,":[93],"problem":[94],"instance":[95],"can":[96],"solved":[98],"machine.":[102],"Using":[103],"approach":[105],"give":[107],"new":[108],"algorithms":[109,128,154,197,213],"variety":[116],"fundamental":[118],"graph":[119],"problems":[120],"sufficiently":[122],"dense":[123],"graphs.":[124],"Specifically,":[125],"present":[127],"minimum":[130,144],"spanning":[131],"trees,":[132],"maximal":[133,217],"matchings,":[134,137],"approximate":[135,138],"weighted":[136],"vertex":[139],"edge":[141],"covers":[142],"cuts.":[145],"all":[147],"these":[149],"cases,":[150],"parameterize":[152],"our":[153,196,212,226],"by":[155],"amount":[157],"memory":[159,171],"available":[160,172],"machines":[163,189],"allowing":[164],"us":[165],"show":[167,184,229],"tradeoffs":[168],"between":[169],"number":[175,202],"rounds.":[178,205],"For":[179],"each":[180],"setting":[181],"will":[183],"even":[186],"if":[187],"are":[190],"only":[191],"given":[192],"substantially":[193],"sublinear":[194],"memory,":[195],"run":[198],"constant":[201],"To":[206],"demonstrate":[207],"practical":[209],"viability":[210],"implement":[215],"matching":[218],"algorithm":[219],"lies":[221],"at":[222],"core":[224],"analysis":[227],"it":[231],"achieves":[232],"significant":[234],"speedup":[235],"over":[236],"sequential":[238],"version.":[239]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}