Hamiltonian path problem
Hamiltonian path problem In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining ...
http://en.wikipedia.org/wiki/Hamiltonian_path_problem - 4k - Cached - Similar pages

Hamiltonian path
Hamiltonian path In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected ... which visits each vertex exactly once. A Hamiltonian cycle is a cycle in an undirected graph which visits ...
http://en.wikipedia.org/wiki/Hamiltonian_path - 7k - Cached - Similar pages

Travelling salesman problem
Travelling salesman problem The travelling salesman problem (TSP), is a problem in discrete or combinatorial optimization. It is ... complexity theory which are hard to solve. Problem statement Given a number of cities and ... or distance of that road), find a Hamiltonian cycle with the least weight. It ...
http://en.wikipedia.org/wiki/Travelling_salesman_problem - 28k - Cached - Similar pages

Wandering salesman problem
Wandering salesman problem The wandering salesman problem is a problem in discrete optimization, similar to the traveling salesman problem. The problem can be stated as follows: given ...
http://en.wikipedia.org/wiki/Wandering_salesman_problem - 1k - Cached - Similar pages

Bottleneck traveling salesman problem
Bottleneck traveling salesman problem The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. It is stated as follows: Find the Hamiltonian cycle in a weighted graph with the ...
http://en.wikipedia.org/wiki/Bottleneck_traveling_salesman_problem - 4k - Cached - Similar pages

Talk:Route inspection problem
Talk:Route inspection problem Is the information here relevance to the "route inspection problem"? It seems a little bit off topic ... only a condition that ensure that a Hamiltonian cycle exist, we cannot conclude the other way ...
http://en.wikipedia.org/wiki/Talk:Route_inspection_problem - 0k - Cached - Similar pages

Zero-knowledge proof
... specially for the purpose, Peggy knows a Hamiltonian cycle in G (most easily, she could have created the edges forming the cycle first and then added other edges). Peggy ... Victor by proving that she knows a Hamiltonian cycle in G. Even though G is ...
http://en.wikipedia.org/wiki/Zero-knowledge_proof - 28k - Cached - Similar pages

List of mathematics articles (G-I)
... Generalized special orthogonal group -- Generalized star height problem -- Generalized taxicab number -- Generalized Woodall number -- Generalized ... differintegral Gu — Gz Gudermannian function -- Guillotine problem -- Guttman scale -- Gyrate bidiminished rhombicosidodecahedron -- Gyrate rhombicosidodecahedron ... inequality -- Hadwiger conjecture (graph theory) -- Hadwiger-Nelson problem -- Hadwiger's theorem -- Hahn-Banach theorem -- Hahn ... space -- Hall-Janko graph -- Hall subgroup -- Halting problem -- Halton sequences -- Ham sandwich theorem -- Hamburger moment problem -- Hamel basis -- Hamel dimension -- Hamilton-Jacobi- ...
http://en.wikipedia.org/wiki/List_of_mathematics_articles_(G-I) - 63k - Cached - Similar pages

List of mathematics articles (H)
... inequality -- Hadwiger conjecture (graph theory) -- Hadwiger-Nelson problem -- Hadwiger's theorem -- Hahn-Banach theorem -- Hahn ... space -- Hall-Janko graph -- Hall subgroup -- Halting problem -- Halton sequences -- Ham sandwich theorem -- Hamburger moment problem -- Hamel basis -- Hamel dimension -- Hamilton-Jacobi-Bellman equation -- Hamilton-Jacobi equations -- Hamiltonian -- Hamiltonian cycle problem -- Hamiltonian group -- Hamiltonian mechanics -- ...
http://en.wikipedia.org/wiki/List_of_mathematics_articles_(H) - 22k - Cached - Similar pages

Talk:NP-complete
... know is that if any NP-hard problem is in P then all NP problems ... to NP, then for every NP-complete problem, there is a subproblem that can be ... hardest problems in NP by definition (A problem is NP-complete if it belongs to ... can be used to solve any NP problem through a polynomial time reduction). SAT was ... be NP-complete by solving the SAT problem with them. Jan David Mol 12: ...
http://en.wikipedia.org/wiki/Talk:NP-complete - 19k - Cached - Similar pages