Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

< Back to Article

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

Figure 5

Results for 4-regular planar graphs.

Runtime analysis over random 4-regular planar graphs between 100 and 1000 vertices. Plot (a) shows the running times as a function of the number of vertices for both kinds of instance types. Plot (b) shows the proportion of 3-colorable and non-3-colorable graphs over the total number of graphs per number of vertices.

Figure 5

doi: https://doi.org/10.1371/journal.pone.0053437.g005