Parallel algorithms for minimum spanning trees
id:
parallel-algorithms-for-minimum-spanning-trees-321-3949305
title:
Parallel algorithms for minimum spanning trees
text:
In graph theory a minimum spanning tree (MST) T of a graph G = with | V | = n and | E | = m is a tree subgraph of G that contains all of its vertices and is of minimum weight. MSTs are useful and versatile tools utilised in a wide variety of practical and theoretical fields. For example, a company looking to supply multiple stores with a certain product from a single warehouse might use an MST originating at the warehouse to calculate the shortest paths to each company store. In this case the st
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Parallel_algorithms_for_minimum_spanning_trees
date created:
date modified:
2023-07-31T00:04:16Z
main entity:
{"identifier":"Q65073333","url":"https://www.wikidata.org/entity/Q65073333"}
image:
fields total:
13
integrity:
13