Prev: Cantor Confusion
Next: Fermat's Last theorem short proof
From: sarah on 10 Feb 2007 10:53
Hi all,
I wanted to know whether for any graph G and any minimum spanning tree
T of G, is there a valid execution of Kruskal's algorithm on G that
produces T as output?
Can you give me a proof or a counter example?

 | 
Pages: 1
Prev: Cantor Confusion
Next: Fermat's Last theorem short proof