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

Glencora Borradaile, Philip N. Klein (2006)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/BorradaileK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BorradaileK06
Glencora Borradaile, Philip N. Klein:
An O (n log n) algorithm for maximum st-flow in a directed planar graph. SODA 2006: 524-533

a service of

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.