Enumeration of the Elementary Circuits of a Directed Graph

DOI10.1137/0202017zbMath0274.05106OpenAlexW2281218127WikidataQ92189608 ScholiaQ92189608MaRDI QIDQ5181391

Robert Endre Tarjan

Publication date: 1973

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/5941

Mathematics Subject Classification ID

Related Items (31)

Algorithms to count paths and cycles ⋮ Performance evaluation of marked graphs by linear programming ⋮ Structure-based deadlock checking of asynchronous circuits ⋮ All Circuits Enumeration in Macro-Econometric Models ⋮ A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ 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 ⋮ Random number generation using decimal cellular automata ⋮ Geometrical regular languages and linear Diophantine equations: the strongly connected case ⋮ Output-polynomial enumeration on graphs of bounded (local) linear MIM-width ⋮ Unnamed Item ⋮ Organising metabolic networks: cycles in flux distributions ⋮ Applications of graph theory in computer systems ⋮ Complexity of counting cycles using zeons ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ A search strategy for the elementary cycles of a directed graph ⋮ Wieferich pairs and Barker sequences, II ⋮ Hierarchical partition—a new optimal pivoting algorithm ⋮ Algebraic determination of circuits in a directed graph ⋮ Exact localisations of feedback sets ⋮ Geometrical Regular Languages and Linear Diophantine Equations ⋮ Optimum tearing in large scale systems and minimum feedback cutsets of a digraph ⋮ Enumerating Minimal Dominating Sets in Triangle-Free Graphs ⋮ Wieferich pairs and Barker sequences ⋮ Unnamed Item ⋮ Signsolvability revisited ⋮ Finding all the negative cycles in a directed graph ⋮ Enumerating extreme points of a highly degenerate polytope ⋮ A direct method for calculating cell cycles of a block map of a simple planar graph

This page was built for publication: Enumeration of the Elementary Circuits of a Directed Graph