"An O(n log n) algorithm for maximum st-flow in ..."

Glencora Borradaile, Philip N. Klein (2009)

> Home

Details and statistics

DOI: 10.1145/1502793.1502798

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/BorradaileK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/BorradaileK09
Glencora Borradaile, Philip N. Klein:
An O(n log n) algorithm for maximum st-flow in a directed planar graph. J. ACM 56(2): 9:1-9:30 (2009)

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.