On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Cédric Bentz 1
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Document type :
Journal articles
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01126374
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:52:42 AM
Last modification on : Monday, January 20, 2020 - 8:19:20 PM

Identifiers

  • HAL Id : hal-01126374, version 1

Collections

CNAM | CEDRIC-CNAM

Citation

Cédric Bentz. On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics, Elsevier, 2008, 156, pp.1908-1917. ⟨hal-01126374⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

61

Contact

Informations

CCSD