A search strategy for the elementary cycles of a directed graph
From MaRDI portal
Publication:4096432
Cites work
- scientific article; zbMATH DE number 3465357 (Why is no real title available?)
- scientific article; zbMATH DE number 3344287 (Why is no real title available?)
- A Backtrack Procedure for Isomorphism of Directed Graphs
- A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
- 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
- An efficient search algorithm to find the elementary circuits of a graph
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Depth-First Search and Linear Graph Algorithms
- Efficient Planarity Testing
- Enumeration of the Elementary Circuits of a Directed Graph
- Finding All the Elementary Circuits of a Directed Graph
- Nondeterministic Algorithms
- Systematic generation of Hamiltonian circuits
Cited in
(9)- Cycle detection in critical path networks
- Cograph generation with linear delay
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
- Enumerating the cycles of a digraph: a new preprocessing strategy
- On a cycle finding algorithm
- Signsolvability revisited
- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- Graphical methods for analysing feedback in biological networks -- a survey
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)
