论文信息 - A genetic algorithm for determining the thickness of a graph

A genetic algorithm for determining the thickness of a graph

Abstract 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 an NP-complete problem. This paper discusses the possibility of determining the thickness of a graph using a genetic algorithm. Our tests show that the genetic approach outperforms the earlier heuristic algorithms reported in the literature.

Erkki Mäkinen | Timo Poranen | Petri Vuorenmaa

[1] Robert E. Tarjan,et al. An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem , 1992, SIAM J. Comput..

[2] John H. Halton,et al. On the thickness of graphs of given degree , 1991, Inf. Sci..

[3] Michael Jünger,et al. The thickness of a minor-excluded class of graphs , 1998, Discret. Math..

[4] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .

[5] Robert J. Cimikowski,et al. On Heuristics for Determining the Thickness of a Graph , 1995, Inf. Sci..

[6] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[7] Erkki Mäkinen,et al. Remarks on the Thickness of a Graph , 1998, Inf. Sci..

[8] Anthony Mansfield,et al. Determining the thickness of graphs is NP-hard , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.

[9] Petra Mutzel,et al. The Thickness of Graphs: A Survey , 1998, Graphs Comb..

[10] J. Moon,et al. On the thickness of the complete bipartite graph , 1964, Mathematical Proceedings of the Cambridge Philosophical Society.

[11] Edward R. Scheinerman,et al. On the thickness and arboricity of a graph , 1991, J. Comb. Theory, Ser. B.

[12] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[13] G. Kant. An O(n2) maximal planarization algorithm based on PQ-trees , 1992 .