"An O(n²(m + n log n)log n) min-cost flow algorithm."

Zvi Galil, Éva Tardos (1988)

> Home

Details and statistics

DOI: 10.1145/42282.214090

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/GalilT88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/GalilT88
Zvi Galil, Éva Tardos:
An O(n²(m + n log n)log n) min-cost flow algorithm. J. ACM 35(2): 374-386 (1988)

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.