Re: Hamiltonian Cycles algorithm

"alex05" <alexmcferron@xxxxxxxxx> schrieb:
Does anyone know what the fastest algorithm is for finding if a graph has a hamiltonian cycle? 

Since it is unknown whether P=NP or not,
the best approximation algorithm is
unknown either.

Regards,
Joachim

.

Relevant Pages

  • Re: Vista Media Center Crash
    ... Either the component that raises this event is not installed on your local computer or the installation is corrupted. ... P4: unknown ... it immediately crashes and sends a ...
    (microsoft.public.windows.mediacenter)
  • Re: The Minoan origin of the Phaistos disc
    ... >solution has to be SOMETHING NEW, UNKNOWN until now!... ... >NATURAL SUPPOSITION is to suppose that it's "a Minoan Calendar", ... calling to mind those eight name of months: ...
    (sci.archaeology)
  • Re: The Minoan origin of the Phaistos disc
    ... solution has to be SOMETHING NEW, UNKNOWN until now!... ... NATURAL SUPPOSITION is to suppose that it's "a Minoan Calendar", ... Regards ... > linguistic analyses demand an unreserved attitude to these ...
    (sci.archaeology)
  • Re: mailx: a lot of new mail
    ... But it is fairly new, and mailx, coming with Debian 3.0 ... Well, when I hit r to reply, I then hit ~m to include the original letter ... Unknown tilde escape. ...
    (comp.unix.questions)
  • Re: What everyone needs to know
    ... regards, Richard ... > Unknown wrote: ... > Self-anointed Moderator ...
    (microsoft.public.windowsxp.general)