352 search results - page 24 / 71 » Partitioning Graphs into Connected Parts |
128
click to vote
CF
2009
ACM
15 years 10 months ago
2009
ACM
There is a trend towards using accelerators to increase performance and energy efficiency of general-purpose processors. Adoption of accelerators, however, depends on the availabi...
116
click to vote
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
112
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
118
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
118
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...