minimum connector problem

Show Summary Details

Quick Reference

The problem in graph theory to find the minimum total length of a connected graph. In practical terms this is the situation faced by service companies laying cables or pipes, which is essentially different from constructing any sort of transport links between the points. Kruskal's algorithm and Prim's algorithm are two standard approaches to solving this problem.

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.