Survey / Graph (Bibtex)

P399: Alglrotihms for enumeration of all cycles in a given graph

Input:

A graph $G$.

Output:

All cycles belonging to $G$.

Complexity:

Comment:

26 cycle enumeration algorithms are introduced.

Reference:

[Mateti1976a] (Bibtex)

P337: Enumeration of clique enumeration

Input:

Output:

Complexity:

Comment:

In Sec.3.

Reference:

[Pardalos1994] (Bibtex)

P329: Enumeration of gray code algorithms

Input:

Output:

Complexity:

Comment:

Reference:

[Savage1997] (Bibtex)