A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:21, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple algorithm for finding a cycle of length greater than three and without diagonals |
scientific article |
Statements
A simple algorithm for finding a cycle of length greater than three and without diagonals (English)
0 references
1981
0 references
algorithm
0 references
cycle
0 references
