A dichotomy for minimum cost graph homomorphisms.
Gregory Z. GutinPavol HellArash RafieyAnders YeoPublished in: Eur. J. Comb. (2008)
Keyphrases
- minimum cost
- spanning tree
- undirected graph
- graph theory
- np hard
- approximation algorithms
- network flow
- network flow problem
- capacity constraints
- minimum cost path
- graph structure
- network simplex algorithm
- edit operations
- random walk
- random graphs
- directed graph
- graph matching
- weighted graph
- graph partitioning
- graph model
- graph theoretic
- graph representation
- computational complexity
- connected components
- structured data
- scheduling problem
- special case