184 search results - page 34 / 37 » Packing Cliques in Graphs with Independence Number 2 |
PODC
2011
ACM
12 years 10 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
AMC
2006
13 years 7 months ago
2006
A new methodology for the reliability evaluation of an l-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a numbe...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...