

%Please answer the following:
%
%1.  Name of conference
%
%    Eighth SIAM Conference on Parallel Processing for Scientific Computing
%    March 14-17, 1997  Minneapolis, Minnesota
%
%2.  Type of Presentation
%
%    Contributed:  Lecture format
%
%3.  Equipment for Visual Support
%
%    Overhead Projector    
%
%6.  If more than one author, who will present the paper?
%
%    Frederick C. Harris, Jr.
%
%7.  Please include at least 3 keywords but no 
%    more than 5 in order of importance below.
% 
%    1) Crossing Number
%    2) Combinatorial Optimization
%    3) Parallel Branch-and-Bound
% 

\documentstyle[02-abstract]{report} 
\begin{document}
 
\title{Parallel Computation of the Minimal Crossing Number of a Graph}
 
\abstract{
	Determining the crossing number of a graph is an important 
        problem with applications in areas such as circuit design 
	and network configuration.				  
	In this paper we present the first parallel algorithm for 
	solving this combinatorial optimization problem.           
	This branch-and-bound algorithm, which adds and deletes    
	crossings in an organized fashion,                         
	presents us with the opportunity to verify many            
	conjectures which are decades old,                         
	as well as pursuing future work in efficient circuit       
        design.                                                    
}%74 words


\author{
Umid Tadjiev\\
Department of Computer Science \\
University of Nevada \\
Reno, NV 89557 \\
tadjiev@cs.unr.edu \\
\\
Frederick C. Harris, Jr.\\
Department of Computer Science\\
University of Nevada\\
Reno, NV 89557\\
fredh@cs.unr.edu}

\eject 

\end{document}

% end of example file.
%
%Please furnish complete addresses all co-authors.
%
% Umid Tadjiev
% Department of Computer Science
% University of Nevada
% Reno, NV 89557
% tadjiev@cs.unr.edu
%
% Frederick C. Harris, Jr.
% Department of Computer Science
% University of Nevada
% Reno, NV 89557
% fredh@cs.unr.edu
% Phone: (702) 784-6571
% Fax:   (702) 784-1877
%
