A new algorithm to find all elementary circuits of a directed graph

MaRDI QIDQ3641415zbMATH OpenFDO

Authors Yuying Wang, Ping Chen, Yang Su

Publication date 11 November 2009

zbMATH Keywords

directed graphelementary directed circuitmatrix operation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1247175
• Determination of a circuit in a directed graph
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
• Enumeration of Hamiltonian circuits in digraphs
• scientific article; zbMATH DE number 3946164

Cited in

(6)

• A simple systolic method to find all bridges of an undirected graph
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
• Determination of a circuit in a directed graph
• scientific article; zbMATH DE number 15657 (Why is no real title available?)
• scientific article; zbMATH DE number 1215120 (Why is no real title available?)
• scientific article; zbMATH DE number 1247175 (Why is no real title available?)

This page was built for publication: A new algorithm to find all elementary circuits of a directed graph

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