An evolutionary formulation of the crossing number problem

DOI10.1155/2009/154015MaRDI QIDQ1040098zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

evolutionary algorithmcomplete graphscrossing numberEAgraph drawing algorithmminimum crossings

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1109408
• An algorithmic development to minimize crossings in electronic circuits
• Graph Drawing
• Recent advances in exact crossing minimization (extended abstract)
• scientific article; zbMATH DE number 2170413

Cites work

• scientific article; zbMATH DE number 871167 (Why is no real title available?)
• scientific article; zbMATH DE number 3394160 (Why is no real title available?)
• Crossing Number is NP-Complete
• Graph Drawing
• The crossing number of K₁₁ is 100
• Toward a theory of crossing numbers

Cited in

(2)

• Exact solution for the boundary-crossing problem in genetic mapping experiment
• Number of cycles in evolutionary operation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040098)