An evolutionary formulation of the crossing number problem (Q1040098)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An evolutionary formulation of the crossing number problem |
scientific article |
Statements
An evolutionary formulation of the crossing number problem (English)
0 references
23 November 2009
0 references
Summary: A graph drawing algorithm is presented which results in complete graphs having minimum crossings equal to that of Guy's conjecture. It is then generalized and formulated in an evolutionary algorithm (EA) to perform constrained search for the crossing numbers. The main objective of this work is to present a suitable two-dimensional scheme which can greatly reduce the complexity of finding crossing numbers by using computer. Program performance criteria are presented and discussed. It is shown that the EA implementation provides good confirmation of the predicted crossing numbers.
0 references
graph drawing algorithm
0 references
complete graphs
0 references
minimum crossings
0 references
evolutionary algorithm
0 references
EA
0 references
crossing number
0 references