Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Hamiltonian path problem 6 found (33 total)

alternate case: hamiltonian path problem

Zero-weight cycle problem (380 words) [view diff] exact match in snippet view article find links to article

polynomial magnitude. In particular, there is a reduction from the Hamiltonian path problem, on an n {\displaystyle n} -vertex unweighted graph G {\displaystyle
Matroid intersection (1,718 words) [view diff] exact match in snippet view article find links to article
the Hamiltonian path problem in directed graphs. Given a directed graph G with n vertices, and specified nodes s and t, the Hamiltonian path problem is
Topological sorting (3,170 words) [view diff] exact match in snippet view article find links to article
whether a Hamiltonian path exists, despite the NP-hardness of the Hamiltonian path problem for more general directed graphs (i.e., cyclic directed graphs)
Yuri Gurevich (836 words) [view diff] case mismatch in snippet view article find links to article
60-65. Y. Gurevich and S. Shelah. Expected computation time for Hamiltonian Path Problem. SIAM Journal on Computing 16:3, 1987, 486-502. Y. Gurevich. Average
Gap reduction (1,183 words) [view diff] exact match in snippet view article find links to article
not satisfy the conditions of a metric). We can reduce from the Hamiltonian path problem on a given graph G = (V, E) to this problem as follows: we construct
Timeline of United States inventions (after 1991) (3,495 words) [view diff] exact match in snippet view article
use of DNA as a form of computation which solved the seven-point Hamiltonian path problem. 1994 Segway PT The Segway PT is a two-wheeled, self-balancing