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 Theoretical Computer Science Year : 2020

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

(1) , (2)

1
2

Cédric Bentz

Function : Author
PersonId : 181270
IdHAL : cedric-bentz

CEDRIC. Optimisation Combinatoire

Pierre Le Bodic

Function : Author

Monash University [Melbourne]

Domains

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

Fichier principal

S030439751930790X.pdf (404.95 Ko)

Origin : Files produced by the author(s)

Accord Elsevier CCSD : Connect in order to contact the contributor

https://hal-cnam.archives-ouvertes.fr/hal-02444300

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

Dates and versions

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

Licence

Attribution - NonCommercial

Identifiers

HAL Id : hal-02444300 , version 1
DOI : 10.1016/j.tcs.2019.12.015
PII : S0304-3975(19)30790-X

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNAM TDS-MACS CEDRIC-CNAM

143 View

47 Download

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

Domains

Dates and versions

Licence

Identifiers

Cite

Export

Collections

Altmetric

Share