Hamiltonian cycle in polynomial time (P=NP)
International Scientific Journal of Engineering and Management · 28.06.2026 · 05 (06) · 1-4
DOI: 10.55041/isjem08077 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Scientific Journal of Engineering and Management, online erschienen am 28.06.2026. Verfasst von Sanket kulkarni Sanket kulkarni.
Abstract (Originalsprache)
This paper presents polynomial time algorithm for Hamiltonian cycle problem. The proposed approach uses dynamic programming to reduce exponential states while giving optimal solution in O(N^6) time complexity which proves P=NP.
Zitieren
APA
kulkarni, S. K. S. (2026). Hamiltonian cycle in polynomial time (P=NP). International Scientific Journal of Engineering and Management, 05(06), 1-4. https://doi.org/10.55041/isjem08077
Vancouver
kulkarni SKS. Hamiltonian cycle in polynomial time (P=NP). International Scientific Journal of Engineering and Management. 2026;05(06):1-4. doi:10.55041/isjem08077
BibTeX
@article{kulkarni2026,
author = {kulkarni, Sanket kulkarni Sanket},
title = {Hamiltonian cycle in polynomial time (P=NP)},
journal = {International Scientific Journal of Engineering and Management},
year = {2026},
volume = {05},
number = {06},
pages = {1--4},
doi = {10.55041/isjem08077}
}
EUVIMED