3008 search results - page 21 / 602 » Independence in connected graphs |
95
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
116
Voted
COMBINATORICS
2002
15 years 14 days ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
88
Voted
ARSCOM
2008
15 years 23 days ago
2008
62
Voted
COMBINATORICA
2002
15 years 14 days ago
2002
118
Voted
EJC
2010
15 years 22 days ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...