OpenAlex
PricingAboutJobs
Log inGet started
Work

Incremental algorithms for minimal length paths

HTML

Year: 1990
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/320176.320178
Authors: Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
Institutions: Sapienza University of Rome, Columbia University, University of L'Aquila
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: all-pairs shortest paths, dynamic graphs, incremental algorithms, edge insertion, shortest path queries, dynamic data structures, longest path, directed acyclic graphs, online algorithms

Open Access status: closed
OpenAlex ID: W2028750248
FWCI: 3.519
Cites: 20
Cited by: 43
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