• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity.

Florent FoucaudHervé HocquardDimitri LajouValia MitsouThéo Pierron
Published in: Algorithmica (2022)
Keyphrases
  • graph clustering
  • weighted graph
  • decision problems
  • computational complexity
  • graph structure
  • graph model
  • neural network
  • optimization problems
  • np complete
  • random walk
  • shortest path
  • spanning tree
  • disjoint paths