Journal Articles
Theoretical Computer Science
Year : 2017
Ignasi Sau : Connect in order to contact the contributor
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01630777
Submitted on : Wednesday, November 8, 2017-10:50:04 AM
Last modification on : Tuesday, September 3, 2024-1:56:20 PM
Dates and versions
Identifiers
- HAL Id : lirmm-01630777 , version 1
- ARXIV : 1605.00532v1
- DOI : 10.1016/j.tcs.2017.06.013
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⟩
Collections
137
View
0
Download