Graph / Other (Bibtex)

P416: Enumeration of all Hamiltonian centers in a graph

Input:

A graph $G$.

Output:

All Hamiltonian centers in $G$.

Complexity:

Comment:

Reference:

[Yau1967] (Bibtex)

P346: Enumeration of all CA-sets of a directed graph

Input:

A directed graph $G = (V, E)$.

Output:

All CA-sets of $G$.

Complexity:

$O(|V|^{2.49+} + \gamma)$.

Comment:

$\gamma$ is the output size. $S \subset V$ is a \textit{CA-set} if, for each $v \in S$, all ancestor of $v$ belongs to $S$.

Reference:

[Kashiwabara1992] (Bibtex)

P253: Enumeration of all maximal induced subgraphs for (connected) hereditary graph properties

Input:

A graph $G$.

Output:

All maximal induced subgraphs in $\mathcal{P}(G)$.

Complexity:

See the paper.

Comment:

$\mathcal{P}$ is a set of subgraphs of $G$ with (connected) hereditary graph properties.

Reference:

[Cohen2008] (Bibtex)