Re: [R] Efficient deterministic algorithm for Matching Weighted Graphs with bounded degree.

2012-08-02 Thread Petr Savicky
On Wed, Aug 01, 2012 at 06:19:29AM -0700, khris wrote: > Hi Petr, > > The following is different line of thought which is posted in different form, > maybe you have some wise input on it. > > "I need to find Efficient(tracktable) deterministic algorithm for Matching > Weighted Graphs with bound

[R] Efficient deterministic algorithm for Matching Weighted Graphs with bounded degree.

2012-08-01 Thread khris
Hi Petr, The following is different line of thought which is posted in different form, maybe you have some wise input on it. "I need to find Efficient(tracktable) deterministic algorithm for Matching Weighted Graphs with bounded degree. Now we all know Graph matching is non-tractable but when