An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’

DOI10.1080/00207728608926847zbMath0585.05009OpenAlexW1993170496MaRDI QIDQ3710537

Umberto Viaro, G. Romanin Jacur, Antonio Lepschy

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/00207728608926847

zbMATH Keywords

digraphadjacency matrixelementary pathscircuit of even lengthcircuits of odd length

Mathematics Subject Classification ID

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

Cites Work

• An algorithm for finding a circuit of even length in a directed graph

This page was built for publication: An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’