graph_culberson_variability: 3-Colorable with Variability Graph (+IID) Source:...
In caranha/EvoGCP: Evolutionary Computation Tools for the Graph Coloring Problem

Description Usage Arguments Details Value Examples

The algorithm is defined in 3 steps:

1	graph_culberson_variability(N, probability = 1, delta = 0)

`N`	Integer - number of vertices in the graph.
`probability`	0..1 - edge's probability.
`delta`	0, 1, 2 - variability. It generates an uniform graph when delta = 0.

1- Create a permutation of nodes 2- Create 3 groups with N/3 nodes, with variability delta 2- Assign edges using IID method

a list with two elements: V - number of nodes in the graph, and E - an edge list in the shape of a 2xE matrix. The graph is guaranteed to have a valid 3-coloring, but not guaranteed to be connected.