646 search results - page 27 / 130 » Generalized connected domination in graphs |
117
click to vote
MMNS
2007
15 years 3 months ago
2007
An important question in multi-radio multi-channel and multi-hop networks is how to perform efficient network-wide broadcast. Currently almost all broadcasting protocols assume a s...
102
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
114
click to vote
PAMI
2007
15 years 1 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
129
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
131
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...