Login / Signup

Minimum Cost Homomorphisms to Reflexive Digraphs.

Arvind GuptaPavol HellMehdi KarimiArash Rafiey
Published in: LATIN (2008)
Keyphrases
  • minimum cost
  • undirected graph
  • np hard
  • network flow
  • approximation algorithms
  • spanning tree
  • equivalence classes
  • network flow problem
  • capacity constraints
  • directed graph
  • network simplex algorithm
  • minimum cost flow