OpenAlex
PricingAboutJobs
Log inGet started
Work

An optimal parallel connectivity algorithm

HTML PDF

Year: 1984
Type: article
Source: Discrete Applied Mathematics
DOI: 10.1016/0166-218x(84)90019-2
Author: Uzi Vishkin
Institutions: Courant Institute of Mathematical Sciences, New York University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: connected components, undirected graphs, parallel algorithms, depth complexity, graph connectivity

Open Access status: bronze
OpenAlex ID: W2019998590
FWCI: 7.403
Cites: 17
Cited by: 67
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