Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
| Origin | Files produced by the author(s) |
|---|
Journal Articles
Theoretical Computer Science
Year : 2020
Accord Elsevier CCSD : Connect in order to contact the contributor
https://cnam.hal.science/hal-02444300
Submitted on : Monday, March 7, 2022-2:12:17 PM
Last modification on : Tuesday, September 3, 2024-1:56:20 PM
Long-term archiving on : Wednesday, June 8, 2022-7:54:35 PM
Dates and versions
Licence
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⟩
Collections
176
View
95
Download