An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph (Q4575868): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 17:27, 5 March 2024
scientific article; zbMATH DE number 6904150
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph |
scientific article; zbMATH DE number 6904150 |
Statements
An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph (English)
0 references
16 July 2018
0 references
