"Linear time algorithms for finding sparsest cuts in various graph classes."

Paul S. Bonsma (2007)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2007.01.039

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/Bonsma07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/Bonsma07
Paul S. Bonsma:
Linear time algorithms for finding sparsest cuts in various graph classes. Electron. Notes Discret. Math. 28: 265-272 (2007)

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.