To access the full text documents, please follow this link: http://hdl.handle.net/2117/97639
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor.author | Thilikos Touloupas, Dimitrios |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.author | Bodlaender, Hans L. |
dc.date | 2001-02 |
dc.identifier.citation | Thilikos, D., Serna, M., Bodlaender, H. "A Polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth". 2001. |
dc.identifier.uri | http://hdl.handle.net/2117/97639 |
dc.language.iso | eng |
dc.relation | LSI-01-4-R |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject | Cutwidth |
dc.subject | Treewidth |
dc.subject | Pathwidth |
dc.title | A Polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/report |
dc.description.abstract |