An Evolutionary Formulation of the Crossing Number Problem

Che Sheng Gan, Wee Chiat Alan Tan, Voon Chet Koo and Kwang Hwai Mak

Discrete Dynamics in Nature and Society, 2009, vol. 2009, 1-10

Abstract:

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.

Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2009/154015.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2009/154015.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:154015

DOI: 10.1155/2009/154015

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().