"Vertex Bisection is Hard, too."

Ulrik Brandes, Daniel Fleischer (2009)

> Home

Details and statistics

DOI: 10.7155/JGAA.00179

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/BrandesF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/BrandesF09
Ulrik Brandes, Daniel Fleischer:
Vertex Bisection is Hard, too. J. Graph Algorithms Appl. 13(2): 119-131 (2009)

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.