A simulated annealing algorithm for determining the thickness of a graph

DOI10.1016/j.ins.2004.02.029zbMath1087.68074OpenAlexW2087646797MaRDI QIDQ2568255

Timo Poranen

Publication date: 10 October 2005

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2004.02.029

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

The thickness of amalgamations and Cartesian product of graphs ⋮ The thickness of the complete multipartite graphs and the join of graphs ⋮ The thickness of K1,n,n and K2,n,n ⋮ A simple simulated annealing algorithm for the maximum clique problem ⋮ A dynamic all parameters adaptive BP neural networks model and its application on oil reservoir prediction ⋮ Remarks on the thickness and outerthickness of a graph

Uses Software

• DIMACS

Cites Work

• A note on Halton's conjecture
• Worst case analysis of a greedy algorithm for graph thickness
• On the thickness and arboricity of a graph
• The book thickness of a graph
• On the thickness of graphs of given degree
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The thickness of graphs: A survey
• A genetic algorithm for determining the thickness of a graph
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Planarizing Graphs - A Survey and Annotated Bibliography
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Determining the thickness of graphs is NP-hard
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Efficient Planarity Testing
• An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
• On the Thickness of Sparse Random Graphs
• Geometric Thickness of Complete Graphs
• Equation of State Calculations by Fast Computing Machines
• The Thickness of the Complete Graph
• Die dicke des n-dimensionalen Würfel-graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simulated annealing algorithm for determining the thickness of a graph