BIT Numerical Mathematics

, Volume 6, Issue 4, pp 347–349

An algorithm for computing all paths in a graph

Authors

  • Lars-Erik Thorelli
    • Research Group for Information ProcessingUniversity of Stockholm
Scientific Notes

DOI: 10.1007/BF01966095

Cite this article as:
Thorelli, L. BIT (1966) 6: 347. doi:10.1007/BF01966095

Copyright information

© BIT Foundations 1966