Login / Signup

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.

Florent FoucaudHervé HocquardDimitri LajouValia MitsouThéo Pierron
Published in: IPEC (2019)
Keyphrases
  • parameterized complexity
  • optimization problems
  • database
  • np complete
  • random walk
  • decision problems
  • weighted graph