I'm looking for a proof for camerini algorithm for finding MBST in undirected graph . I couldn't find anywhere and I couldn't do it myself. Thanks. problem explanation
Asked
Active
Viewed 340 times
1
-
https://stackoverflow.com/questions/22875799/how-to-compute-a-minimum-bottleneck-spanning-tree-in-linear-time – Maxim Sagaydachny Nov 21 '19 at 14:43
-
There is no proof there.. – Robert Nov 21 '19 at 15:00