672 search results - page 11 / 135 » Lower-stretch spanning trees |
FCT
2005
Springer
14 years 1 months ago
2005
Springer
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...