An algorithmic development to minimize crossings in electronic circuits

MaRDI QIDQ3165721zbMATH OpenFDO

Authors Matthew Wolfe, Bryan McCauley, Joyati Debnath

Publication date 19 October 2012

Full work available at URL http://iospress.metapress.com/content/w7571m15ll11117l/fulltext.html

zbMATH Keywords

adjacency matrixarraycomplete graphcrossing numberedgeJavaobject classtwo dimensional arrayUMLvertex

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Graph Drawing
• An algorithm for the graph crossing number problem
• scientific article; zbMATH DE number 1054768
• Recent advances in exact crossing minimization (extended abstract)
• On the Crossing Number of Almost Planar Graphs

Cited in

(2)

• An evolutionary formulation of the crossing number problem
• scientific article; zbMATH DE number 3896699 (Why is no real title available?)

This page was built for publication: An algorithmic development to minimize crossings in electronic circuits

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