"A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with ..."

Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-44676-1_32

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/esa/ThilikosSB01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/ThilikosSB01
Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender:
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. ESA 2001: 380-390

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.