Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01630777
Contributor : Ignasi Sau <>
Submitted on : Wednesday, November 8, 2017 - 10:50:04 AM
Last modification on : Friday, April 12, 2019 - 10:18:10 AM

Links full text

Identifiers

Collections

Citation

Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theoretical Computer Science, Elsevier, 2017, 690, pp.91-103. ⟨10.1016/j.tcs.2017.06.013⟩. ⟨lirmm-01630777⟩

Share

Metrics

Record views

161