Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems - Archive ouverte HAL
Conference Papers Year : 2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems

Domains

Combinatorics [math.CO] Computational Complexity [cs.CC]

Dimitri Lajou  : Connect in order to contact the contributor

https://hal.science/hal-02491871

Submitted on : Wednesday, February 26, 2020-2:26:01 PM

Last modification on : Friday, May 17, 2024-4:10:02 PM

Consult the full text

Dates and versions

hal-02491871 , version 1 (26-02-2020)

Identifiers

Cite

Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Theo Pierron. Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC 2019, Sep 2019, Munich, Germany. pp.15:1-16, ⟨10.4230/LIPIcs.IPEC.2019.15⟩. ⟨hal-02491871⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UNIV-ORLEANS INSA-GROUPE INSA-CVL UP-SCIENCES IRIF
57 View
0 Download

Altmetric

Share

More