OpenAlex
PricingAboutJobs
Log inGet started
Work

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

HTML

Year: 1999
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
DOI: 10.1007/978-3-540-48413-4_24
Authors: Seth Pettie, Vijaya Ramachandran
Institution: The University of Texas at Austin
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: minimum spanning forest, randomized parallel algorithms, EREW PRAM, logarithmic time complexity, linear works, weighted undirected graphs, graph algorithms

Open Access status: closed
OpenAlex ID: W2462459316
FWCI: 1.717
Cites: 22
Cited by: 11
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