Skip to content

Opening book details…

About this Computer Science article

On the Complexity of the Multicut Problem in Bounded Tree-width Graphs and Digraphs by Cédric Bentz is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Cédric Bentz
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
Published
2008
Language
EN
Field
Computer Science (Physical Sciences)

More by Cédric Bentz

Browse all works by Cédric Bentz