Skip to main content
Skip to navigation
Skip to toolbar
An O(n4) time algorithm to compute the bisection width of solid grid graphs
| Metadata Label | Value |
|---|---|
| Author(s): | Feldmann, Andreas Emil, Widmayer, Peter |
| Publisher: | ETH, Department of Computer Science |
| Citation: | Feldmann, Andreas Emil and Widmayer, Peter. An O(n4) time algorithm to compute the bisection width of solid grid graphs. ETH, Department of Computer Science (2011). http://dx.doi.org/10.3929/ethz-a-006935587 |
| Document Type: | Reports |
| Documents: |
Text
(342.83KB) |
Detailed Information
| Metadata | Description |
|---|---|
| Title | An O(n4) time algorithm to compute the bisection width of solid grid graphs |
| Author(s) |
Feldmann, Andreas Emil Widmayer, Peter |
| Publication Place | Zurich |
| Publisher | ETH, Department of Computer Science |
| Publication Date | 2011 |
| Series | [Technical report / Swiss Federal Institute of Technology Zurich, Department of Computer Science] [730] |
| Language | English |
| DOI | http://dx.doi.org/10.3929/ethz-a-006935587 |
| Subject(s) | Computer Science, General |
| Organisational Unit | Department of Computer Science |
| Online Publication Date | 2011 |
| Description | File Name | MIME Type | Size |
|---|---|---|---|
| Text |
eth-5184-01.pdf |
application/pdf | 342.83KB |
| Description | URL |
|---|---|
| NEBIS Link | http://opac.nebis.ch/F/?local_base=NEBIS&func=find-b&find_code=SYS&request=006935587 |
Abstract Views and Downloads  |
||
|---|---|---|
| Views | 17 |  |
| Downloads | 7 |  |
| Abstract Views and Downloads by Country |
|||
|---|---|---|---|
 |
Views | 8 | |
| Downloads | 3 | |
|
 Switzerland |
Views | 4 | |
| Downloads | 2 | |
|
 Austria |
Views | 1 | |
| Downloads | 1 | |
|
 Japan |
Views | 0 | |
| Downloads | 1 | |
|
 China |
Views | 2 | |
| Downloads | 0 | |
|
 Korea, Republic of |
Views | 1 | |
| Downloads | 0 | |
|
 Turkey |
Views | 1 | |
| Downloads | 0 | |
|
E-Collection record created: Sat, 11 Feb 2012, 06:41:13 CET