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
2 Monash University [Melbourne]
Document type :
Journal articles
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 : Friday, August 21, 2020 - 1:56:05 PM

Identifiers

Collections

CNAM | TDS-MACS | CEDRIC-CNAM | UNIV-HESAM

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

157