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 OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/1.9781611974782.122 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2907002631 / rank | |||
Normal rank | |||
Latest revision as of 18:20, 19 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
