Login / Signup
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
Arvind Gupta
Gregory Z. Gutin
Mehdi Karimi
Eun Jung Kim
Arash Rafiey
Published in:
CoRR (2007)
Keyphrases
</>
minimum cost
undirected graph
np hard
network flow
spanning tree
network flow problem
approximation algorithms
capacity constraints
equivalence classes
directed graph
network simplex algorithm
transitive closure
minimum cost flow