"An efficient flow routing algorithm to solve the maximum concurrent flow ..."

Farhad Shahrokhi (1986)

> Home

Details and statistics

DOI: 10.1145/324634.325329

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/acm/Shahrokhi86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acm/Shahrokhi86
Farhad Shahrokhi:
An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packed switched telecommunication networks and cluster analysis (abstract). ACM Conference on Computer Science 1986: 494

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.