"An O(|V|³) Algorithm for Finding Maximum Flows in Networks."

Vishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari (1978)

> Home

Details and statistics

DOI: 10.1016/0020-0190(78)90016-9

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/MalhotraKM78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/MalhotraKM78
Vishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari:
An O(|V|³) Algorithm for Finding Maximum Flows in Networks. Inf. Process. Lett. 7(6): 277-278 (1978)

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.