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

Takehiro Ito Naoki Sakamoto Xiao Zhou Takao Nishizeki

Published in: FAW (2010)

Keyphrases

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