Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs

Gregory Z. Gutin Arash Rafiey Anders Yeo

Published in: CoRR (2006)

Keyphrases

minimum cost
undirected graph
spanning tree
np hard
approximation algorithms
network flow
network flow problem
network simplex algorithm
capacity constraints
random graphs
graph model
bipartite graph
optimal solution
special case
equivalence classes
lower bound
edit operations
minimum cost flow