Finding All the Elementary Circuits of a Directed Graph
From MaRDI portal
Publication:5183524
DOI10.1137/0204007zbMath0275.05112OpenAlexW2083342911MaRDI QIDQ5183524
Publication date: 1975
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a1894966c9c7090f9bdcff87aaa85924be40f18b
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Strong linear programming relaxations for the orienteering problem, Cyclic robot scheduling for 3D printer-based flexible assembly systems, Cliques and cavities in the human connectome, Computing and listing \(st\)-paths in public transportation networks, On the number of circuits in random graphs, Stability structures of conjunctive Boolean networks, All Circuits Enumeration in Macro-Econometric Models, Optimising the multilateral netting of fungible OTC derivatives, Set-oriented numerical computation of rotation sets, On the graph Laplacian and the rankability of data, D-optimal input design for nonlinear FIR-type systems: a dispersion-based approach, Selective routing problem with synchronization, Heuristics for the multi-depot petrol station replenishment problem with time windows, Semi-invariants of gentle algebras by deformation method and sphericity, A general purpose algorithm for counting simple cycles and simple paths of any length, A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems, Deadlock avoidance algorithm for flexible manufacturing systems by calculating effective free space of circuits†, An Exact Method for the Minimum Feedback Arc Set Problem, Experimental study of algorithms for minimization of binary decision diagrams using algebraic representations of cofactors, Diagnosis of timed patterns for discrete event systems by means of state isolation, Counting cycles on planar graphs in subexponential time, On a cycle finding algorithm, Reconstruction of Domains with Algebraic Boundaries from Generalized Polarization Tensors, Clustering effect of iterative differential and linear trails, Counting cycles on planar graphs in subexponential time, From drinking philosophers to asynchronous path-following robots, Methods for determining cycles of a specific length in undirected graphs with edge weights, Asymptotic stability of probabilistic logical networks with random impulsive effects, Verification of data-aware process models: checking soundness of Data Petri nets, Determination of a circuit in a directed graph, Random number generation using decimal cellular automata, A Hopf algebra for counting cycles, ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES, The number of circuits of length 4 inPSL(2,ℤ)-space, Towards a theory of game-based non-equilibrium control systems, Evader interdiction: algorithms, complexity and collateral damage, Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications, Variety and connectivity in kinematic chains, A search strategy for the elementary cycles of a directed graph, \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Graph Lyapunov function for switching stabilization and distributed computation, Computation of minimal diagnosis bases of discrete-event systems using verifiers, On robust input design for nonlinear dynamical models, Integer linear programming for the Bayesian network structure learning problem, The petrol station replenishment problem with time windows, A Polynomial Algorithm for Computing Elementary Siphons in a Class of <scp>P</scp>etri Nets, Computing and Listing st-Paths in Public Transportation Networks, An algorithm for finding a circuit of even length in a directed graph, Verification of C-detectability using Petri nets, An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks, Exact localisations of feedback sets, Cycle detection in critical path networks, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, Unnamed Item, An algorithm for then×n optimum assignment problem, Loops of any size and Hamilton cycles in random scale-free networks, Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches, The Power of Prime Cycles, Analysis of strong and strong periodic detectability of bounded labeled Petri nets, Clustering analysis of a dissimilarity: a review of algebraic and geometric representation, Exact Goodness‐of‐Fit Tests for Markov Chains, Unnamed Item, Reduction of the small gain condition for large‐scale interconnections, Identifying the structure of cycling in ecosystems, Approximability issues of guarding a set of segments, Signsolvability revisited, A graph theoretical approach to input design for identification of nonlinear dynamical models, Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks, A direct method for calculating cell cycles of a block map of a simple planar graph
