"Jonah H. Harris" <[EMAIL PROTECTED]> writes:
> Wikipedia has the algorithm itself
> (http://en.wikipedia.org/wiki/Kruskal's_algorithm), but I was more
> interested in the actual applicability to PG and any issues they ran
> into.
Hmm ... minimum spanning tree of a graph, eh? Right offhand I'd sa
On Sat, May 10, 2008 at 5:12 PM, Tom Lane <[EMAIL PROTECTED]> wrote:
> "Jonah H. Harris" <[EMAIL PROTECTED]> writes:
>> Repost to -hackers, you're more likely to get a response on this topic.
>
> Probably not, unless you cite a more readily available reference.
> (I dropped my IEEE membership maybe
"Jonah H. Harris" <[EMAIL PROTECTED]> writes:
> Repost to -hackers, you're more likely to get a response on this topic.
Probably not, unless you cite a more readily available reference.
(I dropped my IEEE membership maybe fifteen years ago ...)
regards, tom lane
--
Sent
Repost to -hackers, you're more likely to get a response on this topic.
On Sat, May 10, 2008 at 1:31 PM, Rauan Maemirov <[EMAIL PROTECTED]> wrote:
> On May 8, 2:09 am, [EMAIL PROTECTED] ("Alexander Staubo") wrote:
>> On 5/7/08, Tarcizio Bini <[EMAIL PROTECTED]> wrote:
>>
>> > I'm working on optimi
On May 8, 2:09 am, [EMAIL PROTECTED] ("Alexander Staubo") wrote:
> On 5/7/08, Tarcizio Bini <[EMAIL PROTECTED]> wrote:
>
> > I'm working on optimizing queries using the Kruskal algorithm
> > (http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4318118).
>
> That paper looks very interesting. I wou
