𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A finite-difference sieve to count paths and cycles by length

✍ Scribed by Eric Bax; Joel Franklin


Book ID
104137284
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
367 KB
Volume
60
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis


We present algorithms to count paths and cycles of a given length in a directed graph. The algorithms have time complexity 0( 2" poly n) and space complexity 0( poly n).


πŸ“œ SIMILAR VOLUMES