334 search results - page 25 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
115
Voted
SIAMNUM
2010
14 years 10 months ago
2010
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
144
Voted
ICDCSW
2003
IEEE
15 years 9 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
220
Voted
WAE
2001
15 years 5 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
153
Voted
TCAD
2008
15 years 3 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
114
Voted
PATMOS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...