"Improved bounds and algorithms for graph cuts and network reliability."

David G. Harris, Aravind Srinivasan (2018)

> Home

Details and statistics

DOI: 10.1002/RSA.20724

access: closed

type: Journal Article

metadata version: 2022-02-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/HarrisS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/HarrisS18
David G. Harris, Aravind Srinivasan:
Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms 52(1): 74-135 (2018)

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.