Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth - Cnam - Conservatoire national des arts et métiers Access content directly
Journal Articles Theoretical Computer Science Year : 2020

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

Cédric Bentz
Fichier principal
Vignette du fichier
S030439751930790X.pdf (404.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02444300 , version 1 (07-03-2022)

Licence

Attribution - NonCommercial

Identifiers

Cite

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, 2020, 809, pp.239-249. ⟨10.1016/j.tcs.2019.12.015⟩. ⟨hal-02444300⟩
149 View
62 Download

Altmetric

Share

Gmail Facebook X LinkedIn More