"An O(n4) Time Algorithm to Compute the Bisection Width of Solid ..."

Andreas Emil Feldmann, Peter Widmayer (2015)

> Home

Details and statistics

DOI: 10.1007/S00453-014-9928-Y

access: closed

type: Journal Article

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/FeldmannW15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/FeldmannW15
Andreas Emil Feldmann, Peter Widmayer:
An O(n⁴) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica 71(1): 181-200 (2015)

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.