OpenAlex
PricingAboutJobs
Log inGet started
Work

Computing shortest paths with comparisons and additions

HTML

Year: 2002
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/545381.545417
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: all-pairs shortest paths, single-source shortest path, pointer machine, sparse graphs, inverse Ackermann function, Dijkstra's algorithm, directed graphs

Open Access status: closed
OpenAlex ID: W2048824634
FWCI: 5.944
Cites: 42
Cited by: 80
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