On Algorithms for Enumerating All Circuits of a Graph

DOI10.1137/0205007MaRDI QIDQ4097318zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Graph theory (05C99) Algorithms in computer science (68W99)

Cited in

(27)

• Minor and minimum cycle bases of a 3-connected planar graph
• Identifying the structure of cycling in ecosystems
• Recognizing max-flow min-cut path matrices
• Enumerating the cycles of a digraph: a new preprocessing strategy
• \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
• Cycle detection in critical path networks
• Characterizations of outerplanar graphs
• Estimations for the number of cycles in a graph
• Stability structures of conjunctive Boolean networks
• Complexity of minimum irreducible infeasible subsystem covers for flow networks
• Graph Lyapunov function for switching stabilization and distributed computation
• The maximum number of cycles in a graph with fixed number of edges
• A general purpose algorithm for counting simple cycles and simple paths of any length
• 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
• Determination of a circuit in a directed graph
• A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems
• The flow circulation sharing problem
• Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
• Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
• All Circuits Enumeration in Macro-Econometric Models
• A direct method for calculating cell cycles of a block map of a simple planar graph
• Enumerating \(m\)-length walks in directed graphs with constant delay
• Exact localisations of feedback sets
• Cyclic robot scheduling for 3D printer-based flexible assembly systems
• Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

Describes a project that uses

Uses Software

• Algorithm 447

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)