104 search results - page 8 / 21 » On an Online Spanning Tree Problem in Randomly Weighted Grap... |
102
click to vote
SODA
2007
ACM
15 years 3 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
138
click to vote
CATS
1998
15 years 3 months ago
1998
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...
114
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
122
click to vote
COLOGNETWENTE
2009
15 years 2 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
121
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...