180 search results - page 6 / 36 » Minimum congestion spanning trees in planar graphs |
EGH
2009
Springer
13 years 5 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
IJCM
2010
13 years 5 months ago
2010
IPPS
2003
IEEE
14 years 19 days ago
2003
IEEE
ICALP
1997
Springer
13 years 11 months ago
1997
Springer
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...