137 search results - page 8 / 28 » Locally connected spanning trees on graphs |
ASPDAC
2001
ACM
15 years 3 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
GC
2007
Springer
14 years 11 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
104
click to vote
SODA
1998
ACM
15 years 1 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...