Re: Hamiltonian Cycles algorithm

"Hans-Christoph Wirth" <hcw@xxxxxxxxxxxxx> schrieb:
Enumerate all n! tuples of vertices and check whether the tuple forms a cycle. 

One should mention that Blum's speedup
theorem guarantees a linear optimization
to any implementation of your algorithm.

Regards,
Joachim

.

Relevant Pages

  • Re: OT : Approximate / fast math libraries ?
    ... some practical work with the algorithm will tell you the real results. ... It costs no more to calculate doubles than singles except ... depends on the hardware implementations inside the processor and the ... cycle I put into it, along with some additional benefit from hardware ...
    (Fedora)
  • Re: Seed7 programming language and big numbers
    ... where a sequence repeats. ... a record-setting loop cycle length (which is why it's killing ... some tests with the Seed7 version of this algorithm. ... I recieved your C program and started to convert it to Seed7. ...
    (comp.programming)
  • Re: find the largest 1000 values
    ... algorithm you apply n times on a fixed number of elements ... positive integers from experiment. ... discarding the new element or discarding the smallest old one in ...
    (microsoft.public.vc.language)
  • Re: 3n+1 problem
    ... Consider the following algorithm: ... For any two numbers i and j you are to determine the maximum cycle length over ... Sample Input ...
    (comp.lang.lisp)
  • Re: Reversible permutation?
    ... > I guess with 256 elements the fractions of rings with respect to possible ... > Could it make a good PRNG? ... > I can see there are some short cycles but using an algorithm that expands 32 ... > it would be possible to map them into a bad cycle. ...
    (sci.crypt)