Hamiltonian Cycles algorithm

Does anyone know what the fastest algorithm is for finding if a graph
has a hamiltonian cycle?

I know it isn't efficient, but what is the current best we can do?

thanks,
alex

.

Relevant Pages

  • Re: Hamiltonian Cycles algorithm
    ... alex05 wrote: ... > Does anyone know what the fastest algorithm is for finding if a graph ... > has a hamiltonian cycle? ...
    (comp.theory)
  • 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: 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)