OpenAlex
PricingAboutJobs
Log inGet started
Work

Δ-Stepping : A Parallel Single Source Shortest Path Algorithm

HTML

Year: 1998
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Algorithms — ESA’ 98: 6th Annual European Symposium Venice, Italy, August 24–26, 1998 Proceedings
DOI: 10.1007/3-540-68530-8_33
Authors: Ulrich Meyer, Peter Sanders
Institution: Max Planck Institute for Informatics
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: single-source shortest path, parallel algorithms, PRAM, Bellman-Ford algorithm, directed random graphs, random edge weights, linear works, distributed memory systems

Open Access status: closed
OpenAlex ID: W1526460180
FWCI: 1.421
Cites: 28
Cited by: 100
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