Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

Journal article

Open access

Peer reviewed

Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau and Mordechai Shalom

Theoretical Computer Science, Vol.690, pp.91-103

08/2017

Files and links (2)

url

Find in HALView

url

https://doi.org/10.1016/j.tcs.2017.06.013View

Published (Version of record) Open

1 Record Views

Title: Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Creators - without role: Didem Gözüpek - Gebze Technical University
Sibel Özkan - Gebze Technical University
Christophe Paul - Université de Montpellier
Ignasi Sau - Université de Montpellier
Mordechai Shalom - Tel Hai Academic College
Publication Details: Theoretical Computer Science, Vol.690, pp.91-103
Identifiers: 9943961209311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-01630777