OpenAlex
PricingAboutJobs
Log inGet started
Work

Scaling algorithms for network problems

HTML

Year: 1983
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.1983.68
Author: Harold N. Gabow
Institution: University of Colorado Boulder
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: scaling algorithms, network flow algorithms, maximum weight bipartite matching, Hungarian algorithm, Hopcroft-Karp algorithm, single-source shortest path, Bellman-Ford algorithm, Dijkstra's algorithm, minimum cost flow, time complexity bounds

Open Access status: closed
OpenAlex ID: W2084364487
FWCI: 1.364
Cites: 25
Cited by: 37
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