Finding All the Elementary Circuits of a Directed Graph
From MaRDI portal
Cited in
(89)- Identifying the structure of cycling in ecosystems
- On a cycle finding algorithm
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
- Cycle detection in critical path networks
- Strong linear programming relaxations for the orienteering problem
- Cliques and cavities in the human connectome
- Computing and listing \(st\)-paths in public transportation networks
- Stability structures of conjunctive Boolean networks
- Set-oriented numerical computation of rotation sets
- A Hopf algebra for counting cycles
- Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
- Heuristics for the multi-depot petrol station replenishment problem with time windows
- Graph Lyapunov function for switching stabilization and distributed computation
- Verification of C-detectability using Petri nets
- Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets
- On the graph Laplacian and the rankability of data
- Random number generation using decimal cellular automata
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- 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
- D-optimal input design for nonlinear FIR-type systems: a dispersion-based approach
- Semi-invariants of gentle algebras by deformation method and sphericity
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Selective routing problem with synchronization
- An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
- The power of prime cycles
- Exact goodness-of-fit tests for Markov chains
- Approximability issues of guarding a set of segments
- On the number of circuits in random graphs
- An algorithm for finding a circuit of even length in a directed graph
- Deadlock avoidance algorithm for flexible manufacturing systems by calculating effective free space of circuits†
- ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES
- Determination of a circuit in a directed graph
- An algorithm for then×n optimum assignment problem
- A search strategy for the elementary cycles of a directed graph
- Optimising the multilateral netting of fungible OTC derivatives
- The number of circuits of length 4 in \(\mathrm{PSL}(2,\mathbb{Z})\)-space
- Towards a theory of game-based non-equilibrium control systems
- Evader interdiction: algorithms, complexity and collateral damage
- Loops of any size and Hamilton cycles in random scale-free networks
- Computation of minimal diagnosis bases of discrete-event systems using verifiers
- On robust input design for nonlinear dynamical models
- An exact method for the minimum feedback arc set problem
- Reconstruction of domains with algebraic boundaries from generalized polarization tensors
- An IP algorithm for RNA folding trajectories
- Integer linear programming for the Bayesian network structure learning problem
- Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
- Reduction of the small gain condition for large-scale interconnections
- All Circuits Enumeration in Macro-Econometric Models
- A polynomial algorithm for computing elementary siphons in a class of Petri nets
- Computing and listing \(st\)-paths in public transportation networks
- A direct method for calculating cell cycles of a block map of a simple planar graph
- 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
- Clustering effect of iterative differential and linear trails
- From drinking philosophers to asynchronous path-following robots
- Methods for determining cycles of a specific length in undirected graphs with edge weights
- Counting cycles on planar graphs in subexponential time
- Asymptotic stability of probabilistic logical networks with random impulsive effects
- Verification of data-aware process models: checking soundness of Data Petri nets
- Degreewidth: A New Parameter for Solving Problems on Tournaments
- Triangulation of diagonally dominant min-plus matrices
- Generalized possibility computation tree logic with frequency and its model checking
- Data-based control of logical networks
- Conical transition graphs for analysis of asymptotic stability in hybrid dynamical systems
- Robust prognosability of discrete event systems against stealthy sensor attacks
- The Schrijver system of the length polyhedron of an interval order
- Output synchronisation design for master-slave Boolean networks
- A matheuristic for the routing and spectrum allocation problem
- The routing and spectrum allocation problem: a combinatorial optimization survey
- Complexity aspects of the extension of Wagner's hierarchy to k-partitions
- On the delay time in the enumeration of all simple cycles of a directed graph
- Listing 4-cycles
- Two graphs: resolving the periodic reversibility of one-dimensional finite cellular automata
- Existence and construction of a C-shaped module within a floorplan
- Exact localisations of feedback sets
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- PACE solver description: Martin_-J_-Geiger
- The length polyhedron of an interval order
- A reduced Mason's rule for solving linear systems of equations recursively: an application to the integrated ownership problem in a network of companies
- Testing C_k-freeness in bounded admissibility graphs
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
- Signsolvability revisited
- Cyclic robot scheduling for 3D printer-based flexible assembly systems
- A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems
- Variety and connectivity in kinematic chains
- The petrol station replenishment problem with time windows
This page was built for publication: Finding All the Elementary Circuits of a Directed Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5183524)
