An algorithmic development to minimize crossings in electronic circuits

  • Authors:

  • Matthew Wolfe;Bryan McCauley;Joyati Debnath

  • Affiliations:

  • Department of Mathematics and Statistics, Winona State University, Winona, MN;Department of Mathematics and Statistics, Winona State University, Winona, MN;Department of Mathematics and Statistics, Winona State University, Winona, MN

  • Venue:
  • Journal of Computational Methods in Sciences and Engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.