Journal Articles
Discrete Applied Mathematics
Year : 2008
Laboratoire CEDRIC : Connect in order to contact the contributor
https://hal.science/hal-01126374
Submitted on : Friday, March 6, 2015-11:52:42 AM
Last modification on : Friday, July 19, 2024-11:38:05 AM
Dates and versions
Identifiers
- HAL Id : hal-01126374 , version 1
Cite
Cédric Bentz. On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics, 2008, 156, pp.1908-1917. ⟨hal-01126374⟩
Collections
34
View
0
Download