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 annealing and a grouping genetic algorithm for small graphs, the heuristics were not only faster by orders of magnitude, but al...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hilgemeier, M., Drechsler, N., Drechsler, R.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Color Computational modeling Computer science Evolutionary computation Genetic algorithms Heuristic algorithms Optical design Optical fiber networks Simulated annealing Very large scale integration
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!