P423: Enumeration of all maximal induced matchings in a triangle-free graph

P423: Enumeration of all maximal induced matchings in a triangle-free graph

Input:

A triangle-free graph $G$.

Output:

All maximal induced matchings in $G$.

Complexity:

$O(1.4423^n)$ total time with polynomial delay.

Comment:

$n$ is the number of vertices in $G$.

Reference:

[Basavaraju2014] (Bibtex)