1511 search results - page 12 / 303 » Randomness, lowness and degrees |
164
click to vote
CAAN
2007
Springer
16 years 6 days ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
172
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
165
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
135
click to vote
APAL
2010
15 years 6 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
133
click to vote
WCE
2007
15 years 7 months ago
2007
—Networks of coupled dynamical systems exhibit many interesting behaviours such as spatio-temporal chaos, pattern formation and synchronization. Such networks can be used to mode...