3008 search results - page 78 / 602 » Independence in connected graphs |
90
Voted
ROBOCOMM
2007
IEEE
15 years 7 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
133
Voted
EJC
2002
15 years 19 days ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...
93
Voted
CONNECTION
2006
15 years 26 days ago
2006
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
123
Voted
SMI
2003
IEEE
15 years 6 months ago
2003
IEEE
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We als...
97
Voted
GC
2007
Springer
15 years 23 days ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...