15 search results - page 1 / 3 » Spanning trails containing given edges |
54
Voted
DM
2006
14 years 10 months ago
2006
SODA
2012
ACM
13 years 23 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
CORR
2008
Springer
14 years 10 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...
107
click to vote
SAC
2003
ACM
15 years 3 months ago
2003
ACM
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...
CIAC
2000
Springer
15 years 2 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...