On Algorithms for Enumerating All Circuits of a Graph
From MaRDI portal
Publication:4097318
DOI10.1137/0205007zbMath0331.05115OpenAlexW2053957335MaRDI QIDQ4097318
Prabhaker Mateti, Narsingh Deo
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
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (26)
Cyclic robot scheduling for 3D printer-based flexible assembly systems ⋮ Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ Stability structures of conjunctive Boolean networks ⋮ All Circuits Enumeration in Macro-Econometric Models ⋮ Recognizing max-flow min-cut path matrices ⋮ Estimations for the number of cycles in a graph ⋮ A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ Determination of a circuit in a directed graph ⋮ Enumerating the cycles of a digraph: a new preprocessing strategy ⋮ \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems ⋮ Graph Lyapunov function for switching stabilization and distributed computation ⋮ Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems ⋮ Quantitative methods for ecological network analysis ⋮ Algebraic determination of circuits in a directed graph ⋮ An algorithm for finding a circuit of even length in a directed graph ⋮ The maximum number of cycles in a graph with fixed number of edges ⋮ Exact localisations of feedback sets ⋮ Cycle detection in critical path networks ⋮ Characterizations of outerplanar graphs ⋮ Minor and minimum cycle bases of a 3-connected planar graph ⋮ Unnamed Item ⋮ The flow circulation sharing problem ⋮ Identifying the structure of cycling in ecosystems ⋮ A direct method for calculating cell cycles of a block map of a simple planar graph
Uses Software
This page was built for publication: On Algorithms for Enumerating All Circuits of a Graph
