Re: An algorithm with Minimum vertex cover without considering its performance
- From: "eKo1" <berndlosert@xxxxxxxxxxxx>
- Date: 24 Sep 2006 12:12:19 -0700
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.
.
- Follow-Ups:
- Re: An algorithm with Minimum vertex cover without considering its performance
- From: Weng Tianxiang
- Re: An algorithm with Minimum vertex cover without considering its performance
- References:
- An algorithm with Minimum vertex cover without considering its performance
- From: wtxwtx
- Re: An algorithm with Minimum vertex cover without considering its performance
- From: Patricia Shanahan
- Re: An algorithm with Minimum vertex cover without considering its performance
- From: wtxwtx
- Re: An algorithm with Minimum vertex cover without considering its performance
- From: eKo1
- Re: An algorithm with Minimum vertex cover without considering its performance
- From: Weng Tianxiang
- An algorithm with Minimum vertex cover without considering its performance
- Prev by Date: Re: An algorithm with Minimum vertex cover without considering its performance
- Next by Date: On the complexity of determining whether n numbers are distinct
- Previous by thread: Re: An algorithm with Minimum vertex cover without considering its performance
- Next by thread: Re: An algorithm with Minimum vertex cover without considering its performance
- Index(es):
Relevant Pages
|