A genetic algorithm for determining the thickness of a graph

DOI10.1016/S0020-0255(01)00126-8zbMath1004.68124WikidataQ126422528 ScholiaQ126422528MaRDI QIDQ1602541

Petri Vuorenmaa, Timo Poranen, Erkki Maekinen

Publication date: 23 June 2002

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

zbMATH Keywords

genetic algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A simulated annealing algorithm for determining the thickness of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• On the thickness and arboricity 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
• Remarks on the thickness of a graph
• The thickness of a minor-excluded class of graphs
• The thickness of graphs: A survey
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Determining the thickness of graphs is NP-hard
• Efficient Planarity Testing
• An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem

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