An algorithm for computing all paths in a graph

DOI10.1007/BF01966095MaRDI QIDQ5521328zbMATH OpenFDO

Authors Lars-Erik Thorelli

Publication date 1966

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01966095

zbMATH Keywords

topology

Cites work

• A Theorem on Boolean Matrices

Cited in

(5)

• Computational experiences with some transitive closure algorithms
• Two algorithms for fast incremental transitive closure of sparse fuzzy binary relations
• Applications of graph theory in computer systems
• A transitive closure algorithm
• Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

This page was built for publication: An algorithm for computing all paths in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5521328)