On Algorithms for Enumerating All Circuits of a Graph
From MaRDI portal
Publication:4097318
DOI10.1137/0205007zbMath0331.05115MaRDI QIDQ4097318
Narsingh Deo, Prabhaker Mateti
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205007
05C35: Extremal problems in graph theory
05C30: Enumeration in graph theory
05C99: Graph theory
05C20: Directed graphs (digraphs), tournaments
68W99: Algorithms in computer science
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems, \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Estimations for the number of cycles in a graph
Uses Software