Determination of a circuit in a directed graph

DOI10.1080/00207728608926839zbMath0638.68064OpenAlexW2001125987MaRDI QIDQ3779761

Sudhangshu B. Karmakar

Publication date: 1986

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728608926839

zbMATH Keywords

pathsalgorithmgraphdirected circuit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• The complexity of determining a shortest cycle of even length
• Algebraic determination of circuits in a directed graph
• On Algorithms for Enumerating All Circuits of a Graph
• Finding All the Elementary Circuits of a Directed Graph

This page was built for publication: Determination of a circuit in a directed graph