Hamiltonian path problem
In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path (a path in an undirected or directed graph that visits each vertex exactly once) or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.
primaryTopic
Hamiltonian path problem
In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path (a path in an undirected or directed graph that visits each vertex exactly once) or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.
has abstract
En el campo matemático de la t ...... bos problemas son NP-completo.
@es
In the mathematical field of g ...... hortest route will be longer).
@en
No campo matemático da teoria ...... os problemas são NP-completos.
@pt
ハミルトン閉路問題（ハミルトンへいろもんだい）とは、与えられ ...... に研究した数学者ウィリアム・ローワン・ハミルトンの名に因む。
@ja
哈密頓路徑問題（Hamiltonian path probl ...... 密頓迴圈。兩個問題皆為NP完全。為旅行推銷員問題的特殊案例。
@zh
Wikipage page ID
Wikipage revision ID
730,606,573
hypernym
type
comment
En el campo matemático de la t ...... bos problemas son NP-completo.
@es
In the mathematical field of g ...... Both problems are NP-complete.
@en
No campo matemático da teoria ...... os problemas são NP-completos.
@pt
ハミルトン閉路問題（ハミルトンへいろもんだい）とは、与えられ ...... に研究した数学者ウィリアム・ローワン・ハミルトンの名に因む。
@ja
哈密頓路徑問題（Hamiltonian path probl ...... 密頓迴圈。兩個問題皆為NP完全。為旅行推銷員問題的特殊案例。
@zh
label
Hamiltonian path problem
@en
Problema del camino Hamiltoniano
@es
Problema do caminho hamiltoniano
@pt
ハミルトン閉路問題
@ja
哈密頓路徑問題
@zh