Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...