178 search results - page 25 / 36 » Constructing the Spanners of Graphs in Parallel |
ASIAMS
2007
IEEE
14 years 1 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
ICDCS
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...