"Empirical study on sufficient numbers of minimum cuts in strongly ..."

Eric Chang et al. (2020)

> Home

Details and statistics

DOI: 10.1002/NET.21943

access: closed

type: Journal Article

metadata version: 2020-07-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/ChangCGHMRTW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/ChangCGHMRTW20
Eric Chang, Chung-Kuan Cheng, Anushka Gupta, Po-Ya Hsu, Amanda Moffitt, Alissa Ren, Irene Tsaur, Samuel Wang:
Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs. Networks 76(1): 106-121 (2020)

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.