646 search results - page 44 / 130 » Generalized connected domination in graphs |
158
click to vote
FOCS
2008
IEEE
16 years 6 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
157
click to vote
SIGMETRICS
2006
ACM
15 years 11 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
173
click to vote
NIPS
2000
15 years 7 months ago
2000
In an important recent paper, Yedidia, Freeman, and Weiss [11] showed that there is a close connection between the belief propagation algorithm for probabilistic inference and the...
157
click to vote
HT
2003
ACM
15 years 11 months ago
2003
ACM
Web sites today serve many different functions, such as corporate sites, search engines, e-stores, and so forth. As sites are created for different purposes, their structure and...
188
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...