P298: Enumeration of all connected common maximal subgraphs in two graphs

P298: Enumeration of all connected common maximal subgraphs in two graphs

Input:

Two graphs $G$ and $G'$.

Output:

All connected common maximal subgraphs in $G$ and $G'$.

Complexity:

Comment:

Reference:

[Koch2001] (Bibtex)