326 search results - page 16 / 66 » The Minimum-Area Spanning Tree Problem |
SODA
1998
ACM
13 years 10 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
ESA
2000
Springer
14 years 5 days ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
NETWORKS
2008
13 years 8 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
JACM
2000
13 years 8 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
ICALP
2000
Springer
14 years 5 days ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...