2314 search results - page 62 / 463 » Minimal Partitions of a Graph |
52
Voted
JCT
2008
15 years 24 days ago
2008
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
107
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
101
click to vote
JAL
2006
15 years 24 days ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
119
click to vote
CSREASAM
2007
15 years 2 months ago
2007
In this paper, we investigate allocation of data partitions in the network for data objects that are partitioned by using secret sharing schemes [12] or erasure coding schemes [11...
93
Voted
CASES
2007
ACM
15 years 4 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...