Enumerating the cycles of a digraph: a new preprocessing strategy

DOI10.1016/0020-0255(82)90023-8zbMath0501.68030OpenAlexW2044920303MaRDI QIDQ1172396

George Loizou, Peter Thanisch

Publication date: 1982

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(82)90023-8

zbMATH Keywords

graph algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic determination of circuits in a directed graph
• The Complexity of Enumeration and Reliability Problems
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• A search strategy for the elementary cycles of a directed graph
• On Algorithms for Enumerating All Circuits of a Graph
• A Time-Space Trade-Off
• Zur bestimmung aller elementarkreise in gerichteten graphen
• Dividing a Graph into Triconnected Components
• 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: Enumerating the cycles of a digraph: a new preprocessing strategy