Professor Hoffman,

Enclosed is the abstract for a paper I would like to present at the 35th
SEICGCC.

I must request that you schedule this talk befor Friday, as I must fly
out Friday morning.

Thank you for the time and effort in organizing this conference.

Look forward to seeing you again.

--

                  A Time Saving Region Restriction 
          for Calculating the Minimum Crossing Number of Kn
      Judith R. Fredrickson*; Bei Yuan; Frederick C. Harris, Jr.

                   Department of Computer Science
                       University of Nevada
                        Reno, Nevada 89557
                       fredrick@cs.unr.edu

In 1995 Harris and Harris presented an algorithm for calculating the
minimum crossing number of a graph.  This was implemented in parallel by
Tadjiev and Harris in 1997. Since the algorithm presented builds huge
search trees, the need to restrict our search space is very important
as graph sizes grow.  This paper presents a technique for search space
reduction for an algorithm calculating the minimum crossing number of
a complete graph.  We introduce a restriction on the placement of a new
edge in a "good" graph construction.  Graph region examination plays a
roll in the restriction process.  Preliminary results show execution
time for calculating the Minimum Crossing Number of K7 has decreased
by an order of magnitude when employing this restriction.  
Keywords: minimum crossing number, complete graph, region restrictions