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