Enumerating all simple paths in a graph

DOI10.1109/TCS.1978.1084515zbMath0381.05032MaRDI QIDQ4159088

F. Rubin

Publication date: 1978

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

Improved formulations for minimum connectivity network interdiction problems ⋮ Minimal functional routes in directed graphs with dependent edges

This page was built for publication: Enumerating all simple paths in a graph