Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The complexity of finding uniform sparsest cuts in various graph classes."

Paul S. Bonsma et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2011.12.008

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/BonsmaBPP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BonsmaBPP12
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14: 136-149 (2012)

a service of

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.