Finding out the outer thickness of a graph with using GA

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 genetic algorithm for determining the outer thickness

کلیدواژه ها:

Outer thickness ، Genetic algorithm (GA)