1206 search results - page 105 / 242 » Arc-Flags in Dynamic Graphs |
116
click to vote
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
125
Voted
PPOPP
2006
ACM
15 years 6 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
WADS
1993
Springer
15 years 4 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
104
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
DMTCS
2006
15 years 25 days ago
2006
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...