270 search results - page 48 / 54 » Partitioning into Sets of Bounded Cardinality |
EJC
2006
14 years 11 months ago
2006
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...
172
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
Abstract— Many of today’s data-intensive applications manipulate disk-resident data sets. As a result, their overall behavior is tightly coupled with their disk performance. Un...
UIST
2000
ACM
15 years 4 months ago
2000
ACM
We present a general approach to the dynamic representation of 2D space that is well suited for userinterface layout. We partition space into two distinct categories: full and emp...