OpenAlex
PricingAboutJobs
Log inGet started
Work

A robust, efficient, and balanced parallel algorithm for finding connected components

HTML

Year: 2019
Type: conference-paper
Source: IEEE International Conference on Big Data (BigData)
Parent work: 2019 IEEE International Conference on Big Data (Big Data)
DOI: 10.1109/bigdata47090.2019.9006189
Author: M. Asokan
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: connected components, undirected graphs, parallel algorithms, MapReduce, multi-core computing, memory constraints, skewed data, load balancing, iteration complexity, graph clustering, social networks

Open Access status: closed
OpenAlex ID: W3007442590
FWCI: 0.181
Cites: 14
Cited by: 2
Related to: 9
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security