Skip to Main content Skip to Navigation
Journal articles

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

Cédric Bentz 1 Pierre Le Bodic 2 
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Document type :
Journal articles
Complete list of metadata

https://hal-cnam.archives-ouvertes.fr/hal-02444300
Contributor : Accord Elsevier CCSD Connect in order to contact the contributor
Submitted on : Monday, March 7, 2022 - 2:12:17 PM
Last modification on : Wednesday, September 28, 2022 - 5:51:23 AM
Long-term archiving on: : Wednesday, June 8, 2022 - 7:54:35 PM

File

S030439751930790X.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

Collections

Citation

Cédric Bentz, Pierre Le Bodic. Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth. Theoretical Computer Science, Elsevier, 2020, 809, pp.239-249. ⟨10.1016/j.tcs.2019.12.015⟩. ⟨hal-02444300⟩

Share

Metrics

Record views

138

Files downloads

9