Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph (Q3927068): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ro/1981150302331 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2586862314 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/RO/1981150302331 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:59, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph |
scientific article |
Statements
Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph (English)
0 references
1981
0 references
computational comparison of methods
0 references
shortest complete cycle
0 references
circuit
0 references
equivalent Hamiltonian cycle problem
0 references
computational experience
0 references
graphs with random complete distance matrices
0 references
