71 search results - page 9 / 15 » Listing all the minimum spanning trees in an undirected grap... |
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...