Comparision GA nad SA for determining the outer thickness complete graph

The outer thickness of a graph is the minimum number of outer planar sub graph into which graph can be decomposed. We Conjecture that the determining the outer thickness of a graph is also NP- complete. [10] In this paper we show that a greedy algorithm(GRE) for determining theouter thickness complete graph and we mention a simulated annealing(SA) for determining the outer thickness complete graph and we have compared GRE and SA for determining the outer thickness complete graph problem

کلیدواژه ها:

Outer thickness ، greedy algrithm(GRE) ، simulated annealing (SA