P221: Enumeration of all canonical embeddings of rooted graphs

P221: Enumeration of all canonical embeddings of rooted graphs

Input:

Output:

All canonical embeddings of rooted graphs in a class $\mathcal{H}$ over $\mathcal{B}$.

Complexity:

$O(T(n))$ time per solution and $O(S(n) + n)$ space.

Comment:

Reference:

[Zhuang2010b] (Bibtex)