z-logo
open-access-imgOpen Access
A NEW METHOD FOR SEARCHING A HAMILTON CYCLE ON A GRAPH
Author(s) -
Владимир Филиппович Прокопенков
Publication year - 2020
Publication title -
bulletin of ntu khpi series strategic management portfolio program and project management
Language(s) - English
Resource type - Journals
eISSN - 2413-3000
pISSN - 2311-4738
DOI - 10.20998/2413-3000.2020.2.6
Subject(s) - heuristics , mathematical optimization , dijkstra's algorithm , shortest path problem , hamiltonian path problem , graph , hamiltonian path , time complexity , mathematics , computer science , algorithm , theoretical computer science

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom