Lines Matching refs:isomorphism

77 This paper documents the implementation of the \code{isomorphism()}
80 and Brian Osman.  The \code{isomorphism()} function answers the
84 equality is \emph{isomorphism}.
86 More precisely, an \emph{isomorphism} is a one-to-one mapping of the
89 (V_{1},E_{1})$ and $G_{2} = (V_{2},E_{2})$, an isomorphism is a
94 The graph $G_1$ is \emph{isomorphic} to $G_2$ if an isomorphism exists
109 The algorithm used by the \code{isomorphism()} function is, at first
182 extension of the isomorphism to $k$. At this point we are guaranteed
210 such that $i(v) = i(v')$ if there exists some isomorphism $f$ where
376 we can now consider extending the isomorphism. We need to find a match
426 The following is the public interface for the \code{isomorphism}
430 function is an isomorphism $f$ if there is one. The \code{isomorphism}
446 bool isomorphism(const Graph1& G1, const Graph2& G2, IsoMapping f,
500 representing the isomorphism $f$ must be a
542 The following is the outline of the isomorphism algorithm class.  The
544 \code{isomorphism} function, and all of the parameter values are
564     @<Test isomorphism member function@>
581 @d Test isomorphism member function
809 @o isomorphism.hpp
890   return isomorphism(G1, G2, f,
905 bool isomorphism(const Graph1& g1,
926 bool isomorphism(const Graph1& g1, const Graph2& g2)
928   return isomorphism(g1, g2,
934 // vertices of g2 describes an isomorphism.
976 % LocalWords:  Isomorphism Siek isomorphism adjacency subgraph subgraphs OM DFS