102 search results - page 14 / 21 » Spanning trees with minimum weighted degrees |
106
click to vote
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
IJCM
2002
14 years 9 months ago
2002
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...
APPROX
2007
Springer
15 years 3 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 ...