%% LyX 1.3 created this file.  For more info, see http://www.lyx.org/.
%% Do not edit unless you really know what you are doing.
\documentclass[11pt,twocolumn,english]{article}
\usepackage[T1]{fontenc}
\usepackage[latin1]{inputenc}
\pagestyle{empty}

\makeatletter
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% User specified LaTeX commands.
\setlength{\topmargin}{-35pt}
\setlength{\textheight}{690pt}
\setlength{\textwidth}{445pt}
\setlength{\columnsep}{18pt}
\setlength{\oddsidemargin}{3pt}
\setlength{\evensidemargin}{3pt}
\setlength{\parindent}{0.5cm}

%
%         New commands and environments
%

\newcommand{\bigast}{\mbox{\small$\ast$}}
\newcommand{\real}{\mbox{\bf R}}

%
%         Data for Title
%
\title{\vspace*{-25pt}\Large\bf A New Path Algebra \\ for Finding Paths in Graphs}
\author{\vspace*{-21pt} \ \\ \large {Robert Manger} \\
         {\em Department of Mathematics, University of Zagreb} \\
         {\em Bijeni\v{c}ka cesta 30, 10000 Zagreb, Croatia} \\
         {\em E-mail: manger@math.hr}}
\date{ }


\usepackage{babel}
\makeatother
\begin{document}
\thispagestyle{empty}

\noindent \textbf{\emph{\large Abstract.}} \emph{}\\
\emph{ \ }\\
 \emph{} \textbf{\large Keywords.} 

\ \\
 \textbf{\large 1.\ Introduction}\\
 \ \\
 \indent


\ \\
 \textbf{\large 2.\ Preliminaries}\\
 \ \\
 \indent


\ \\
\textbf{\large 6.\ Conclusion}\\
 \ \\
 \indent


\ \\
 \textbf{\large References} \vspace*{1.3ex} \newcounter{mycount} \begin{list}{[\arabic{mycount}]}
  {\usecounter{mycount}\setlength{\leftmargin}{0.5cm}
   \setlength{\parsep}{0pt}\setlength{\itemsep}{2pt}
   \setlength{\labelsep}{0.1cm}}
   \item Carr\'{e} B. Graphs and Networks.
         Oxford: Oxford University Press; 1979.
   \item Huckenbeck U. Extremal Paths in Graphs.
         Berlin: Akademie Verlag; 1997. 
   \item Le Boudec J-Y, Thiran P. Network Calculus.
         LNCS 2050. Berlin: Springer; 2001.
   \item Manger R. Gaussian block algorithms for solving
         path problems. Mathematical Communications 1998;
         3: 67-81.
   \item Manger R. Solving path problems on a network
         of computers. Informatica 2002; 26: 91-100.
   \item Mohri M. Semiring frameworks and algorithms for
         shortest-distance problems. Journal of Automata,
         Languages and Combinatorics 2002; 7: 321-350.
   \item Rote G. Path problems in graphs. Computing
         Supplement 1990; 7: 155-189.
   \item Russling M. Deriving a class of layer-orien\-ted
         graph algorithms. Science of Computer Programming
         1996; 26: 117-132.
\end{list}
\end{document}
