Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems

Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron. Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. In Bart M. P. Jansen, Jan Arne Telle, editors, 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany. Volume 148 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Abstract

Abstract is missing.