An algorithm for computing all paths in a graph

DOI10.1007/BF01966095zbMath0144.45503MaRDI QIDQ5521328

Lars-Erik Thorelli

Publication date: 1966

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (5)

A transitive closure algorithm ⋮ Applications of graph theory in computer systems ⋮ Computational experiences with some transitive closure algorithms ⋮ TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS ⋮ Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

Cites Work

• A Theorem on Boolean Matrices

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