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

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)

• Algebraic determination of circuits in a directed graph
• 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
• Exact localisations of feedback sets
• A direct method for calculating cell cycles of a block map of a simple planar graph
• Cycle detection in critical path networks
• scientific article; zbMATH DE number 7306863 (Why is no real title available?)
• An algorithm for finding a circuit of even length in a directed graph
• Enumerating the cycles of a digraph: a new preprocessing strategy
• All Circuits Enumeration in Macro-Econometric Models
• A general purpose algorithm for counting simple cycles and simple paths of any length
• Quantitative methods for ecological network analysis
• A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems
• \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
• Identifying the structure of cycling in ecosystems
• The flow circulation sharing problem
• 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

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)