{"version":"1.0","type":"link","title":"Parallel algorithms for minimum spanning trees - Newikis","description":"In graph theory a minimum spanning tree (MST) of a graph with and is a tree subgraph of that contains all of its vertices and is of minimum weight.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}