178 search results - page 14 / 36 » Constructing the Spanners of Graphs in Parallel |
SPAA
2003
ACM
14 years 24 days ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
SCAM
2005
IEEE
14 years 1 months ago
2005
IEEE
Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to...
GBRPR
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
TAICPART
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...