OpenAlex
PricingAboutJobs
Log inGet started
Work

Scalable parallel minimum spanning forest computation

HTML

Year: 2012
Type: conference-paper
Source: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
DOI: 10.1145/2145816.2145842
Authors: Sadegh Nobari, Thanh-Tung Cao, Panagiotis Karras, Stéphane Bressan
Institutions: National University of Singapore, Rutgers, The State University of New Jersey
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: minimum spanning forest, parallel graph algorithms, Prim's algorithm, GPU computing, CUDA, scalable graph algorithms, dense graphs, weighted undirected graphs, communication cost minimization, sparse graphs

Open Access status: closed
OpenAlex ID: W2039997255
FWCI: 3.067
Cites: 34
Cited by: 42
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