Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth

Cédric Bentz; Pierre Le Bodic

doi:10.1016/j.tcs.2019.12.015

Journal articles

Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth

Cédric Bentz ¹ Pierre Le Bodic ²

1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire

CEDRIC - Centre d'études et de recherche en informatique et communications

2 Monash University [Melbourne]

Document type :

Journal articles

Domain :

Computer Science [cs]

Computer Science [cs] / Discrete Mathematics [cs.DM]

Complete list of metadatas

https://hal-cnam.archives-ouvertes.fr/hal-02444300
Contributor : Cédric Bentz <>
Submitted on : Friday, January 17, 2020 - 5:16:37 PM
Last modification on : Sunday, February 2, 2020 - 7:15:29 PM

Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth

Identifiers

Collections

Citation

Export

Metrics

139

Contact

Informations

Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth

Identifiers

Collections

Citation

Export

Share

Metrics

139

Contact

Informations