Welcome to the UPF Digital Repository

Cutting up is hard to do: the parameterised complexity of k-Cut and related problems



Cutting up is hard to do: the parameterised complexity of k-Cut and related problems

Thumbnail
Document Type: Article
Version: Submitted version
Date: 2003

This item appears in the following Collection(s)

Search DSpace


Advanced Search

Browse

My Account

Statistics

Compliant to Partaking