A simulated annealing algorithm for determining the thickness of a graph

Authors:
Timo Poranen
Affiliations:
Department of Computer Sciences, University of Tampere, Kanslerinrinne 1, FIN-33014, Finland
Venue:
Information Sciences: an International Journal
Year:
2005

Citing 14
Cited 2

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
On the thickness of graphs of given degree

Information Sciences: an International Journal
On the thickness and arboricity of a graph

Journal of Combinatorial Theory Series B
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
An O(m log n)-time algorithm for the maximal planar subgraph problem

SIAM Journal on Computing
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
On heuristics for determining the thickness of a graph

Information Sciences—Informatics and Computer Science: An International Journal
Efficient Planarity Testing

Journal of the ACM (JACM)
A genetic algorithm for determining the thickness of a graph

Information Sciences—Informatics and Computer Science: An International Journal
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Worst case analysis of a greedy algorithm for graph thickness

Information Processing Letters
A note on Halton's conjecture

Information Sciences—Informatics and Computer Science: An International Journal
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

Applied Soft Computing
Mental map preserving graph drawing using simulated annealing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

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. In this paper we introduce a new heuristic algorithm for determining the thickness of a graph. Our algorithm is based on the simulated annealing optimization scheme. We compare the quality of the solutions and running times of our algorithm against previously tested heuristic algorithms. We show that the simulated annealing is a fast and efficient method to obtain good approximations for the thickness of a graph. We also give a new upper bound for the thickness of complete tripartite graphs, whose vertex sets are of equal size.