Sciweavers

94
Voted
DSD
2003
IEEE
100views Hardware» more  DSD 2003»
15 years 2 months ago
Fast Heuristics for the Edge Coloring of Large Graphs
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...
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler