5606 search results - page 293 / 1122 » Randomization Techniques for Graphs. |
194
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
193
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
156
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
165
click to vote
APWEB
2008
Springer
15 years 8 months ago
2008
Springer
Recent models have introduced the notion of dimensions and hierarchies in social networks. These models motivate the mining of small world graphs under a new perspective. We exempl...
133
click to vote
DM
2008
15 years 6 months ago
2008
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...