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 4

Results for planar graphs.

Runtime analysis over random planar graphs considering instance type and average degree. Plots (a) and (b) also show the running times as a function of the number of vertices but discriminated by the average degree.

Figure 4