A search strategy for the elementary cycles of a directed graph

DOI10.1007/BF01931370zbMath0331.68025MaRDI QIDQ4096432

Peter E. Lauer, Jayme Luiz Szwarcfiter

Publication date: 1976

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (9)

On a cycle finding algorithm ⋮ Cograph generation with linear delay ⋮ Enumerating the cycles of a digraph: a new preprocessing strategy ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ Graphical methods for analysing feedback in biological networks – A survey ⋮ Algorithmic aspects of Steiner convexity and enumeration of Steiner trees ⋮ Cycle detection in critical path networks ⋮ Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals ⋮ Signsolvability revisited

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• A Backtrack Procedure for Isomorphism of Directed Graphs
• Efficient Planarity Testing
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Enumeration of the Elementary Circuits of a Directed Graph
• Finding All the Elementary Circuits of a Directed Graph
• Systematic generation of Hamiltonian circuits
• Nondeterministic Algorithms
• An efficient search algorithm to find the elementary circuits of a graph
• A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A search strategy for the elementary cycles of a directed graph