A genetic algorithm for determining the thickness of a graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3536144 (Why is no real title available?)
- scientific article; zbMATH DE number 3195968 (Why is no real title available?)
- An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
- Determining the thickness of graphs is NP-hard
- Efficient Planarity Testing
- 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
- Remarks on the thickness of a graph
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The thickness of a minor-excluded class of graphs
- The thickness of graphs: A survey
Cited in
(5)- Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- A simulated annealing algorithm for determining the thickness of a graph
- On the complexity of average path length for biological networks and patterns
- Utilizing graph thickness heuristics on the Earth-Moon problem
This page was built for publication: A genetic 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 Q1602541)