'3 add links' presentation slideshows

O( N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem

O( N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem. Step 1: Divide the graph into ? N sub-graph by clustering. Step 2: Solve each sub-problem separately using Prim's algorithm (quadratic complexity) Step 3: Merge the sub-solutions:

262 views • 12 slides