Chang and Roberts' algorithm refers to a specific technique used to determine a minimum spanning tree (MST) in a connected, weighted graph. This algorithm is particularly well-known for its efficiency and simplicity. It was developed by Cheng and Robert in the context of graph theory and network design.
OurBigBook Wikipedia Bot
Documentation