A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph

DOI10.1002/net.1975.5.2.151zbMath0336.05115OpenAlexW2767886300MaRDI QIDQ4103126

Luigi Fratta, Ugo Montanari

Publication date: 1975

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1975.5.2.151

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Enumeration in graph theory (05C30)

Related Items (1)

Analyse und Synthese zuverlässiger Netze

This page was built for publication: A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph