1.1 --- a/doc/groups.dox	Mon Mar 30 17:42:30 2015 +0200
     1.2 +++ b/doc/groups.dox	Thu May 14 16:07:38 2015 +0200
     1.3 @@ -561,6 +561,35 @@
     1.4  */
     1.5  
     1.6  /**
     1.7 +@defgroup graph_isomorphism Graph Isomorphism
     1.8 +@ingroup algs
     1.9 +\brief Algorithms for testing (sub)graph isomorphism
    1.10 +
    1.11 +This group contains algorithms for finding isomorph copies of a
    1.12 +given graph in another one, or simply check whether two graphs are isomorphic.
    1.13 +
    1.14 +The formal definition of subgraph isomorphism is as follows.
    1.15 +
    1.16 +We are given two graphs, \f$G_1=(V_1,E_1)\f$ and \f$G_2=(V_2,E_2)\f$. A
    1.17 +function \f$f:V_1\longrightarrow V_2\f$ is called \e mapping or \e
    1.18 +embedding if \f$f(u)\neq f(v)\f$ whenever \f$u\neq v\f$.
    1.19 +
    1.20 +The standard <em>Subgraph Isomorphism Problem (SIP)</em> looks for a
    1.21 +mapping with the property that whenever \f$(u,v)\in E_1\f$, then
    1.22 +\f$(f(u),f(v))\in E_2\f$.
    1.23 +
    1.24 +In case of <em>Induced Subgraph Isomorphism Problem (ISIP)</em> one
    1.25 +also requires that if \f$(u,v)\not\in E_1\f$, then \f$(f(u),f(v))\not\in
    1.26 +E_2\f$
    1.27 +
    1.28 +In addition, the graph nodes may be \e labeled, i.e. we are given two
    1.29 +node labelings \f$l_1:V_1\longrightarrow L\f$ and \f$l_2:V_2\longrightarrow
    1.30 +L\f$ and we require that \f$l_1(u)=l_2(f(u))\f$ holds for all nodes \f$u \in
    1.31 +G\f$.
    1.32 +
    1.33 +*/
    1.34 +
    1.35 +/**
    1.36  @defgroup planar Planar Embedding and Drawing
    1.37  @ingroup algs
    1.38  \brief Algorithms for planarity checking, embedding and drawing