Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs
Gregory Z. GutinPavol HellArash RafieyAnders YeoPublished in: CoRR (2006)
Keyphrases
- minimum cost
- spanning tree
- undirected graph
- graph theory
- np hard
- approximation algorithms
- network flow
- network flow problem
- network simplex algorithm
- capacity constraints
- minimum cost flow
- edit operations
- graph databases
- graph clustering
- linear programming
- optimal solution
- weighted graph
- graph structure
- graph matching
- dynamic environments