3008 search results - page 21 / 602 » Independence in connected graphs |
CORR
2008
Springer
13 years 11 months 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...
COMBINATORICS
2002
13 years 10 months 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,...
ARSCOM
2008
13 years 11 months ago
2008
COMBINATORICA
2002
13 years 10 months ago
2002
EJC
2010
13 years 11 months 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...