396 search results - page 42 / 80 » An Optimal Minimum Spanning Tree Algorithm |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
AINA
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
IPL
2002
13 years 8 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. Two models were proposed for the service provisioning i...
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...