Re: An algorithm with Minimum vertex cover without considering its performance


eKo1 wrote:
Weng Tianxiang wrote:
1. I don't know what the adjacency graph of G. Please tell it in more
details.

Oops. I meant to say adjanceny matrix. Surely you know what that is.

2. The following operations can be simplified by setting 1 to i's or
j's bit of a bit array L; If K's bit of the bit array L = 1, the vertex
K is selected.

Right. That is much simpler and easier.

3. Please let me know where the algorithm come from. If there is a
reference, please let me know.

I just thought it up when I read this post.

Hi eKo1,
Your algorithm to get minimum vertex cover is wrong.

See the following website and calculate the graph in the webiste and
you will know the algorithm you suggest is wrong.

http://en.wikipedia.org/wiki/Adjacency_Matrix

Thank you.

Weng

.

Relevant Pages

  • Re: regex question - trying to find ".mp3" in a SELECT box
    ... But `Array' is a Function object reference. ... Establish a new execution context using F's FormalParameterList, ... Since is not a primitive value, the exception should be thrown. ... | 5.2 Algorithm Conventions ...
    (comp.lang.javascript)
  • Re: Mergesort Vs Quicksort
    ... I might not have correctly remembered my algorithm of months ago ... for sorting records in an array using one auxilary of the ... on how things turn out from lower levels of recursion, ... whether the number of records in the array segment to be sorted is ...
    (comp.programming)
  • Re: Reference to derived type element by index?
    ... as a set of distinctively-named scalars. ... In another scope, the same common block ... would be a single array. ... algorithm and a specific application of the algorithm, ...
    (comp.lang.fortran)
  • [SUMMARY] Maximum Sub-Array (#131)
    ... # sum the integer values of array contents ... algorithm, ... all possible lengths, to check each subarray. ... $ time ruby -r max_sub_array ...
    (comp.lang.ruby)
  • Re: counting subsets of S so that sum(S_n) = N
    ... and make my algorithm generate only unique subsets? ... and the array of boolean at one step of the algorithm is ... implementation without needing recursion. ... subsequence in W, process it and return. ...
    (comp.programming)