I am searching the Cheriton-Tarjan algorithm for weighted minimum spanning trees, with O(m*loglogn). But I was not able to find it anywhere. Can someone explain me the algorithm or tell me a link as where to find it?

有帮助吗?

解决方案

It's "Tarjan" not "Trajan". That may be a reason why you've had trouble finding it.

Here's pseudocode for the algorithm, taken from here (Graphcs, Algorithms, and Optimization by William Kocay and Donald Kreher):

enter image description here

许可以下: CC-BY-SA归因
不隶属于 StackOverflow
scroll top