211 search results - page 19 / 43 » Counting the number of independent sets in chordal graphs |
135
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
118
Voted
COMBINATORICS
2004
15 years 1 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
86
Voted
WOTE
2010
15 years 7 days ago
2010
Abstract. This paper presents a method for adding end-to-end verifiability to any optical-scan vote counting system. A serial number and set of letters, paired with every candidat...
111
click to vote
FOSSACS
2012
Springer
13 years 9 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
149
Voted
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...