"Sparsest cuts and bottlenecks in graphs."

David W. Matula, Farhad Shahrokhi (1990)

> Home

Details and statistics

DOI: 10.1016/0166-218X(90)90133-W

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/MatulaS90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/MatulaS90
David W. Matula, Farhad Shahrokhi:
Sparsest cuts and bottlenecks in graphs. Discret. Appl. Math. 27(1-2): 113-123 (1990)

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.