Lines Matching refs:isomorphism

44 …-np isomorphism-impl.w; dot -Tps out.dot -o out.eps; dot -Tps in.dot -o in.eps; latex isomorphism-…
64 This paper documents the implementation of the \code{isomorphism()}
67 The \code{isomorphism()} function answers the question, ``are these
73 An \emph{isomorphism} is a one-to-one mapping of the vertices in one
76 $G_{2} = (V_{2},E_{2})$, an isomorphism is a function $f$ such that
81 graph $G_1$ is \emph{isomorphic} to $G_2$ if an isomorphism exists
98 The algorithm used by the \code{isomorphism()} function is, at
117 stage of the recursion we start with an isomorphism $f_{k-1}$ between
121 $G_1$. We try to extend the isomorphism by finding a vertex $v \in V_2
123 have a new isomorphism $f_k$ with $G_1[k] \isomorphic G_2[S \union \{
171 such that $i(v) = i(v')$ if there exists some isomorphism $f$ where
232 The following is the public interface for the \code{isomorphism}
236 function is an isomorphism $f$ if there is one. The \code{isomorphism}
247 bool isomorphism(const Graph1& g1, const Graph2& g2,
253 The main outline of the \code{isomorphism} function is as
295 represents the isomorphism $f$ must be a
406 the possibility of any isomorphism between two graphs by checking to
642 a isomorphism is found between the vertices of $G_1$ in
685 \noindent We have completed creating an isomorphism if \code{k\_iter == last}.
928 extended isomorphism $f_k = f_{k-1} \union \pair{k}{v}$. First
944 isomorphism with $\pair{k}{v}$. We then update the set $S$ (by
947 found an isomorphism for the complete graph, so we copy our local
984 Here we output the header file \code{isomorphism.hpp}. We add a
988 @o isomorphism.hpp -d
997 // See http://www.boost.org/libs/graph/doc/isomorphism-impl.pdf
998 // for a description of the implementation of the isomorphism function
1091       return isomorphism(g1, g2, f,
1101   bool isomorphism(const Graph1& g1,
1126   bool isomorphism(const Graph1& g1, const Graph2& g2)
1151     return isomorphism
1157   // vertices of g2 describes an isomorphism.
1195 % LocalWords:  Isomorphism Siek isomorphism adjacency subgraph subgraphs OM DFS