7129 search results - page 933 / 1426 » Approximation Algorithms for Treewidth |
134
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
132
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
226
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
167
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
174
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...