On Feb 6, 2008 4:54 AM, Rajiv Mathews <[EMAIL PROTECTED]> wrote:
> @Rupesh: Would you please elaborate or provide a reference to this
> "colorwave algorithm" you refer to. (On a lazy search) I couldn't find
> anything useful.
well, I was just trying to give brief hints on the problem type Robin
c
Robin,
You are use colorwave algorithm to solve the problem. In fact this
type of problem is call Minimum Connected Dominating Set or Minimum
Independent Set where no two adjacent vertices are filled with the
same color.
On Feb 5, 2008 1:04 AM, robin <[EMAIL PROTECTED]> wrote:
>
> Hello
>
> I
Thank you! I guess you understood the question now. Consider K and X >=0,
non-negative.
On Nov 24, 2007 10:41 PM, Nat Padmanabhan <[EMAIL PROTECTED]> wrote:
>
> 0 is not a positive numberyour problem statement is wrong then
>
> On Nov 24, 2007 10:56 PM, Rupesh Bhoc
ok for instance, if K=2 then we will will have: 1.x1 + 2.x2 = 2.
Here the possible number of solution will be 2, namely: x1=2, x2=0 or x1=0,
x2=1. Please let me know if any confusion..
On Nov 24, 2007 9:50 PM, Nat Padmanabhan <[EMAIL PROTECTED]> wrote:
>
> I am not sure I understand the problem,
The expression is as below
1.X1 + 2.X2 + 3.X3 + ..+ K.Xk = K
On Nov 24, 2007 9:41 PM, Rupesh Bhochhibhoya <[EMAIL PROTECTED]> wrote:
>
> Hello Geeks,
>
> Is there any efficient algorithm for finding number of possible
> combination of X variables for the given value of K? where all X and K
>
Thank you Karthik for your effort. I figure out lately that My
question is not that much logical. Actually there will be only one
possible combination that we can easily get as we have already got the
sorted lists.
On 7/17/07, Karthik Singaram L <[EMAIL PROTECTED]> wrote:
> Hi,
> Although, I ca
Who the hell is this.! let's get this banned. We don't need such
person in this group
On 4/24/07, candra <[EMAIL PROTECTED]> wrote:
>
> "Hackers Matrix" contains the latest collection of tools and tutorials
> that can help anyone become a security expert. Discover the techniques
> and utilities h
