Borja algorithm for enumerating simple paths in a graph

Warning: count(): Parameter must be an array or an object that implements Countable in /home/styllloz/public_html/qa-theme/donut-theme/qa-donut-layer.php on line 274
0 like 0 dislike
In the framework of work on coursecom need to know what it is. Search engines in unison propose to look for "Beria" instead of "Borja".
In the book Beria K. "graph Theory and its applications" directly, this issue is not addressed. Might be in later publications.
Can someone tell me where to find a detailed description of the algorithm?
by | 3 views

2 Answers

0 like 0 dislike
Never heard of this algorithm. And for the described task it is unlikely to exist. The fact that the enumeration of all simple paths (in which no vertex is not found twice) between any two vertices in the graph the General form is NP-complete problem. In addition to the brute-force method of solution has not been found yet.
0 like 0 dislike
You can see here, if you come
But not the fact that there is exactly the algorithm you are looking for
110,608 questions
257,186 answers
27,880 users