A simulated annealing algorithm for determining the thickness of a graph

DOI10.1016/J.INS.2004.02.029MaRDI QIDQ2568255zbMATH OpenOpenAlexFDO

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

Recommendations

• A simulated annealing algorithm for the maximum planar subgraph problem
• The thickness of graphs: A survey
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Remarks on the thickness and outerthickness of a graph
• Worst case analysis of a greedy algorithm for graph thickness

Cites work

• A genetic algorithm for determining the thickness of a graph
• A note on Halton's conjecture
• An O(m\log n)-Time Algorithm for the Maximal Planar Subgraph Problem
• Determining the thickness of graphs is NP-hard
• Die dicke des n-dimensionalen Würfel-graphen
• Efficient Planarity Testing
• Equation of state calculations by fast computing machines
• Geometric Thickness of Complete Graphs
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3957136 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3458649 (Why is no real title available?)
• scientific article; zbMATH DE number 3536144 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 2065615 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• scientific article; zbMATH DE number 3195968 (Why is no real title available?)
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• On the thickness and arboricity of a graph
• On the thickness of graphs of given degree
• On the Thickness of Sparse Random Graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Planarizing graphs---a survey and annotated bibliography
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The book thickness of a graph
• The thickness of graphs: A survey
• The Thickness of the Complete Graph
• Worst case analysis of a greedy algorithm for graph thickness

Cited in

(9)

• A genetic algorithm for determining the thickness of a graph
• The thickness of amalgamations and Cartesian product of graphs
• The thickness of the complete multipartite graphs and the join of graphs
• 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
• The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
• Graph minors from simulated annealing for annealing machines with sparse connectivity
• The thickness of some complete bipartite and tripartite graphs
• Remarks on the thickness and outerthickness of a graph

Describes a project that uses

Uses Software

• DIMACS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568255)