1798 search results - page 132 / 360 » A Tree for All Seasons |
ENDM
2010
13 years 9 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
PR
2006
13 years 9 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
COMBINATORICS
2004
13 years 9 months ago
2004
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
TON
2002
13 years 8 months ago
2002
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
IPCO
2010
13 years 7 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...