An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’ (Q3710537)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’ |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’ |
scientific article |
Statements
An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’ (English)
0 references
1986
0 references
circuit of even length
0 references
digraph
0 references
adjacency matrix
0 references
circuits of odd length
0 references
elementary paths
0 references
0.9682554
0 references
0.87259847
0 references
0.8698387
0 references
0.86364096
0 references
0.86254215
0 references
0 references
