"Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time."

John H. Reif (1981)

> Home

Details and statistics

DOI: 10.1007/3-540-10843-2_5

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/Reif81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Reif81
John H. Reif:
Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. ICALP 1981: 56-67

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.