OpenAlex
PricingAboutJobs
Log inGet started
Work

Filtering: a method for solving graph problems in MapReduce

HTML

Year: 2011
Type: conference-paper
Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
DOI: 10.1145/1989493.1989505
Authors: Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii
Institutions: Google (United States), University of Illinois Urbana-Champaign
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: MapReduce, filtering, distributed graph algorithms, dense graphs, minimum spanning tree, maximal matching, vertex cover, edge covering, minimum cut, sublinear memory

Open Access status: closed
OpenAlex ID: W2153977620
FWCI: 14.07
Cites: 18
Cited by: 298
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security