Enumeration of the Elementary Circuits of a Directed Graph
From MaRDI portal
Cited in
(32)- Wieferich pairs and Barker sequences
- Optimum tearing in large scale systems and minimum feedback cutsets of a digraph
- Enumerating extreme points of a highly degenerate polytope
- Algorithms to count paths and cycles
- Finding all the negative cycles in a directed graph
- Organising metabolic networks: cycles in flux distributions
- Random number generation using decimal cellular automata
- Structure-based deadlock checking of asynchronous circuits
- Algebraic determination of circuits in a directed graph
- ParaPlan: a tool for parallel reachability analysis of planar polygonal differential inclusion systems
- Performance evaluation of marked graphs by linear programming
- Applications of graph theory in computer systems
- A search strategy for the elementary cycles of a directed graph
- Hierarchical partition—a new optimal pivoting algorithm
- Geometrical regular languages and linear Diophantine equations: the strongly connected case
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
- Wieferich pairs and Barker sequences. II
- Geometrical regular languages and linear Diophantine equations
- All Circuits Enumeration in Macro-Econometric Models
- A direct method for calculating cell cycles of a block map of a simple planar graph
- Counting cycles on planar graphs in subexponential time
- Formal verification of termination criteria for first-order recursive functions
- Counting cycles on planar graphs in subexponential time
- Complexity of counting cycles using zeons
- Common equivalence and size of forgetting from Horn formulae
- The routing and spectrum allocation problem: a combinatorial optimization survey
- Exact localisations of feedback sets
- Signsolvability revisited
- A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems
- Enumerating minimal dominating sets in chordal bipartite graphs
This page was built for publication: Enumeration of 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 Q5181391)
