P45: Counting all acyclic walks in a graph

P45: Counting all acyclic walks in a graph

Input:

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

Output:

The number of acyclic walks in $G$.

Complexity:

Comment:

Reference:

[Babic1993] (Bibtex)