Minimum Reload Cost Cycle Cover in Complete Graphs.

Yasemin Büyükçolak Didem Gözüpek Sibel Özkan

Published in: CoRR (2017)

Keyphrases

minimum cost
spanning tree
data sets
cost reduction
random graphs
graph theoretic
high cost
graph theory
graph matching
pairwise
case study
finding the shortest path
communication cost
graph model
special case
search algorithm
graph construction
real time
structured objects
connected dominating set