"A Faster Algorithm for Finding the Minimum Cut in a Directed Graph."

Jianxiu Hao, James B. Orlin (1994)

> Home

Details and statistics

DOI: 10.1006/JAGM.1994.1043

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/HaoO94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/HaoO94
Jianxiu Hao, James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. J. Algorithms 17(3): 424-446 (1994)

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.