Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.

Takehiro Ito Naoki Sakamoto Xiao Zhou Takao Nishizeki

Published in: IEICE Trans. Inf. Syst. (2011)

Keyphrases

minimum cost
undirected graph
np hard
network flow
approximation algorithms
minimum cost path
spanning tree
network flow problem
edit operations
capacity constraints
edge detection
network simplex algorithm
tree structure
minimum cost flow
decision trees
dynamic environments
weighted graph
lower bound