• No results found

Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem

N/A
N/A
Protected

Academic year: 2019

Share "Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem"

Copied!
15
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Table 1: Overview of presented results. Here m is the number of edges, ∆ the maximum degree, δ the minimum degree, ℓ thelength of the longest simple path, k is the size of the color palette and χ ′ is the chromatic index
Figure 1: Example of a blocked conlict (blocked by another conlicte1,e2). Here, it is (e3,e4) and cannot move furtherdown.
Figure 2: Sketch of a worst-case initial coloring for toroids.
Figure 3: Average runtime of RLS (black dots) and itted regression functions with 95% conidence intervals separated by graphclasses.

References

Related documents