POLYNOMIAL ALGORITHM FOR FINDING A HAMILTONIAN CYCLE ON A GRAPH
The subject of research is the solution of the problem of finding a Hamiltonian cycle on a graph, which in discrete mathematics belongs to the NP complexity class and still retains interest. The aim of this work is to develop a new algorithm for solving this problem, which guarantees finding the opt...
Saved in:
| Published in: | Vìsnik NTU <<HPÌ>>. Serìâ: Strategìčne upravlìnnâ, upravlìnnâ portfelâmi, programami ta proektami (Online) no. 1(3); pp. 55 - 65 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
17.04.2021
|
| ISSN: | 2311-4738, 2413-3000 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!