An algorithmic development to minimize crossings in electronic circuits

Issue title: Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2010

Guest editors: Narayan C. Debnath

Article type: Research Article

Authors: Wolfe, Matthew | McCauley, Bryan | Debnath, Joyati^{; *}

Affiliations: Department of Mathematics and Statistics, Winona State University, Winona, MN, USA | Department of Computer Science, Winona State University, Winona, MN, USA

Correspondence: [*] Corresponding author. E-mail: JDebnath@winona.edu.

Abstract: In this paper we will look at the crossing numbers of graphs and will determine an algorithm that will allow us to construct graphs with minimal crossing numbers. Then we will use our results and apply them constructing more cost efficient electrical circuits.

Keywords: Adjacency matrix, vertex, edge, crossing number, complete graph, array, two dimensional array, object class, UML, Java

DOI: 10.3233/JCM-2011-0385

Journal: Journal of Computational Methods in Sciences and Engineering, vol. 11, no. s1, pp. S149-S162, 2011