Algorithmic Design and Implementation for Constructing Graphs of Circuits with Minimal Crossing Numbers

摘要

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.