2487 search results - page 147 / 498 » Partitions of Graphs into Trees |
148
Voted
NETWORKS
2006
15 years 3 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
109
Voted
IPL
2007
15 years 3 months ago
2007
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
107
Voted
ALGORITHMICA
2002
15 years 3 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
122
Voted
DCG
2002
2002
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
15 years 3 months ago
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
133
Voted
ESA
2003
Springer
15 years 8 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...