"Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) ..."

John H. Reif (1983)

> Home

Details and statistics

DOI: 10.1137/0212005

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Reif83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Reif83
John H. Reif:
Minimum s-t Cut of a Planar Undirected Network in O(n log²(n)) Time. SIAM J. Comput. 12(1): 71-81 (1983)

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.