4 search results - page 1 / 1 » Fast Edge Colorings with Fixed Number of Colors to Minimize ... |
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
DSD
2003
IEEE
13 years 10 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
DISOPT
2010
13 years 5 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...