OpenAlex
PricingAboutJobs
Log inGet started
Work

Max Concurrent Flow Problem

HTML

Year: 2007
Type: article
Source: Journal of Shenyang Normal University
Author: Zhao Da-yu
Institution: Shenyang Normal University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: fully polynomial time approximation scheme, approximation algorithms, approximation ratio, network flow

Open Access status: closed
OpenAlex ID: W2365974292
FWCI:
Cites:
Cited by:
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security