Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph (Q3927068): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2586862314 / rank | |||
Normal rank |
Revision as of 22:49, 19 March 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