146 search results - page 5 / 30 » An Algorithm for Enumerating All Spanning Trees of a Directe... |
133
click to vote
ESA
1994
Springer
15 years 8 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
115
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
109
Voted
ALGORITHMICA
2008
15 years 4 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
117
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
147
click to vote
IPL
2007
15 years 3 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...