Finding All the Elementary Circuits of a Directed Graph
From MaRDI portal
Publication:5183524
DOI10.1137/0204007zbMath0275.05112MaRDI QIDQ5183524
Publication date: 1975
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a1894966c9c7090f9bdcff87aaa85924be40f18b
05C35: Extremal problems in graph theory
05C20: Directed graphs (digraphs), tournaments
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
\(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Strong linear programming relaxations for the orienteering problem