On the complexity of the multicut problem in bounded tree-width graphs and digraphs - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2008

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

Cédric Bentz
No file

Dates and versions

hal-01126374 , version 1 (06-03-2015)

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

CNAM CEDRIC-CNAM
18 View
0 Download

Share

Gmail Facebook X LinkedIn More