# Petri Vuorenmaa

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

- Full text PDF available (1)

Learn More

- Erkki Mäkinen, Timo Poranen, Petri Vuorenmaa
- Inf. Sci.
- 2001

The thickness of a graph is the minimum number of planar subgraphs into which the graph can be decomposed. Determining the thickness of a given graph is known to be a NP-complete problem. This paper discusses the possibility of determining the thickness of a graph by a genetic algorithm. Our tests show that the genetic approach outperforms the earlier… (More)

- ‹
- 1
- ›