Model
Digital Document
Publisher
Florida Atlantic University
Description
There are several theorems which give the upper bounds on the number
of crossings of a graph in a plane. In this thesis we shall program certain heuristic
procedures for finding the layout of the graph with the fewest number of crossings.
We will then examine the output of these procedures to see if they always give us
a graph with the fewest number of crossings.
of crossings of a graph in a plane. In this thesis we shall program certain heuristic
procedures for finding the layout of the graph with the fewest number of crossings.
We will then examine the output of these procedures to see if they always give us
a graph with the fewest number of crossings.
Member of