1027 search results - page 27 / 206 » Ordered Vertex Partitioning |
COCOON
2010
Springer
15 years 3 months ago
2010
Springer
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
118
click to vote
CODES
2010
IEEE
14 years 8 months ago
2010
IEEE
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
COMBINATORICS
2006
14 years 11 months ago
2006
The rules of "Bulgarian solitaire" are considered as an operation on the set of partitions to induce a finite dynamical system. We focus on partitions with no preimage u...
79
Voted
COMBINATORICS
2002
14 years 11 months ago
2002
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
102
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...