{"version":"1.0","type":"link","title":"Distributed minimum spanning tree - Newikis","description":"The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is radically different from the classical sequential problem, although the most basic approach resembles…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/d/d2/Minimum_spanning_tree.svg/1280px-Minimum_spanning_tree.svg.png","thumbnail_width":1280,"thumbnail_height":1033}