A search strategy for the elementary cycles of a directed graph

DOI10.1007/BF01931370zbMATH Open0331.68025MaRDI QIDQ4096432FDOQ4096432

Authors: Peter E. Lauer, Jayme L. Szwarcfiter 

Publication date: 1976

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

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

Uses Software

• Algorithm 447

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096432)