Determination of a circuit in a directed graph

DOI10.1080/00207728608926839MaRDI QIDQ3779761zbMATH OpenOpenAlexFDO

Authors Sudhangshu B. Karmakar

Publication date 1986

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

algorithmdirected circuitgraphpaths

Mathematics Subject Classification ID

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

Recommendations

• A new algorithm to find all elementary circuits of a directed graph
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
• Directed circuits on a torus
• scientific article; zbMATH DE number 6469131
• Finding a long directed cycle

Cites work

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

Cited in

(2)

• A new algorithm to find all elementary circuits of a directed graph
• scientific article; zbMATH DE number 1247175 (Why is no real title available?)

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

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