An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph (Q4575868)
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 O(nm) time algorithm for finding the min length directed cycle in a graph |
scientific article; zbMATH DE number 6904150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
