Parameterized complexity of the MINCCA problem on graphs of bounded decomposability - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Theoretical Computer Science Year : 2017

Dates and versions

lirmm-01630777 , version 1 (08-11-2017)

Identifiers

Cite

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, 2017, 690, pp.91-103. ⟨10.1016/j.tcs.2017.06.013⟩. ⟨lirmm-01630777⟩
124 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More