Enumeration of the Elementary Circuits of a Directed Graph
From MaRDI portal
Publication:5181391
DOI10.1137/0202017zbMath0274.05106WikidataQ92189608 ScholiaQ92189608MaRDI QIDQ5181391
Publication date: 1973
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/5941
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in 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
All Circuits Enumeration in Macro-Econometric Models, Signsolvability revisited, Optimum tearing in large scale systems and minimum feedback cutsets of a digraph, Enumerating extreme points of a highly degenerate polytope, Algorithms to count paths and cycles, Finding all the negative cycles in a directed graph, Algebraic determination of circuits in a directed graph, Performance evaluation of marked graphs by linear programming, Applications of graph theory in computer systems, A search strategy for the elementary cycles of a directed graph, Hierarchical partition—a new optimal pivoting algorithm