\documentclass{rtaloop}
\rtalabel{pattern-matching}


\begin{document}
\begin{problem}{Jean-Claude Raoult}{}{June 1993}

\begin{abstract}
Design pattern-matching algorithms for graphs.
\end{abstract}
There are good algorithms for pattern-matching for words and trees,
but not yet for graphs.

\begin{remark}
An algorithm for finding the rules of a graph grammar
that are applicable to a graph has been given in
\cite{Bunke-Glauser-Tran:91}.
\end{remark}

\begin{submitted}{Bruno Courcelle}{Mon, 31 Jan 2005 10:20:21 +0100}
  Many types of graph embeddings exist. Thus pattern-matching is not uniquely
  defined. However, the difficulty of graph isomorphism indicates there cannot
  exist general algorithms. There may exist in particular cases (bounded
  degree, for other constraints).
\end{submitted}

\end{problem}
\end{document}