1952 search results - page 112 / 391 » Complete partitions of graphs |
135
click to vote
CASES
2003
ACM
15 years 9 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
130
click to vote
JCT
2007
15 years 4 months ago
2007
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
128
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
If G = Kn is the complete graph, the classical Pr
141
click to vote
IPL
2010
15 years 1 months ago
2010
Polynomial algorithms are given for the following two problems:
143
Voted
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...