An evolutionary formulation of the crossing number problem

DOI10.1155/2009/154015zbMath1177.05115OpenAlexW2058156434WikidataQ58647394 ScholiaQ58647394MaRDI QIDQ1040098

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

Publication date: 23 November 2009

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222766

zbMATH Keywords

complete graphscrossing numberevolutionary algorithmEAgraph drawing algorithmminimum crossings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Crossing Number is NP-Complete
• Graph Drawing
• The crossing number of K₁₁ is 100
• Toward a theory of crossing numbers

This page was built for publication: An evolutionary formulation of the crossing number problem