loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Euromicro Symposium on Digital Systems Design (DSD'03)
Fast Heuristics for the Edge Coloring of Large Graphs
Belek-Antalya, Turkey
September 01-September 06
ISBN: 0-7695-2003-0
ASCII Text
x 
 
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler, "Fast Heuristics for the Edge Coloring of Large Graphs," Digital Systems Design, Euromicro Symposium on, pp. 230, Euromicro Symposium on Digital Systems Design (DSD'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/DSD.2003.1231932,
author = {Mario Hilgemeier and Nicole Drechsler and Rolf Drechsler},
title = {Fast Heuristics for the Edge Coloring of Large Graphs},
journal ={Digital Systems Design, Euromicro Symposium on},
volume = {0},
year = {2003},
isbn = {0-7695-2003-0},
pages = {230},
doi = {http://doi.ieeecomputersociety.org/10.1109/DSD.2003.1231932},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Digital Systems Design, Euromicro Symposium on
TI - Fast Heuristics for the Edge Coloring of Large Graphs
SN - 0-7695-2003-0
SP
EP
A1 - Mario Hilgemeier,
A1 - Nicole Drechsler,
A1 - Rolf Drechsler,
PY - 2003
KW - null
VL - 0
JA - Digital Systems Design, Euromicro Symposium on
ER -
 
Mario Hilgemeier, University of Bremen
Nicole Drechsler, University of Bremen
Rolf Drechsler, University of Bremen
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 almost all solutions had the optimal color number; the rest differed by at most two colors.
For large graphs, the heuristics were validated by an evolutionary algorithm. Here, the heuristics often found an optimum or a solution very close to it.
Citation:
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler, "Fast Heuristics for the Edge Coloring of Large Graphs," dsd, pp.230, Euromicro Symposium on Digital Systems Design (DSD'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.