Re: Longest path

"Mahdi" <mahdi.dabestani@xxxxxxxxx> wrote:

A short question :
We want an algorithm that finds the longest simple path in a graph.

NPH

As a simple exercise, try to find a reduction from the Hamiltonian Cycle
problem.

mp

.

Relevant Pages

Re: Continued training with octahedron.
... I showed icosahedral graph by octahedron. ... There is Hamiltonian cycle count 2560 in the below table of link. ... this is equal to edge's cycle in octahedron. ... One ant is on a vertex of icosahedron. ...
(sci.math)
Re: Continued training with octahedron.
... I showed icosahedral graph by octahedron. ... There is Hamiltonian cycle count 2560 in the below table of link. ... this is equal to edge's cycle in octahedron. ... One ant is on a vertex of icosahedron. ...
(sci.math)
Re: Continued training with octahedron.
... I showed icosahedral graph by octahedron. ... There is Hamiltonian cycle count 2560 in the below table of link. ... this is equal to edge's cycle in octahedron. ... One ant is on a vertex of icosahedron. ...
(sci.math)
Re: For Luna - Exercise And Weight Control/Maintenance
... > successful weight reduction programs, ... > of exercise to weight loss is modest at best. ... I have known several people who have used walking 10 to 15 miles per day ...
(sci.med.cardiology)
Re: Labelling polyhedron faces
... Graph Theory. ... You're looking for a Hamiltonian cycle in the icosohedron ... To get the other condition (n is opposite n+6), ...
(sci.math)