Login / Signup

The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs.

Pavol HellArash Rafiey
Published in: SIAM J. Discret. Math. (2012)
Keyphrases
  • minimum cost
  • minimum cost flow
  • network flow
  • network flow problem
  • np hard
  • np complete
  • evolutionary algorithm
  • edit distance
  • spanning tree
  • polynomially solvable